Big O notation is asymptotic. Using only 5 insertions to understand Big O is definitely the wrong way. For example, insertion sort works better when the array is small, but insertion sort is definitely O(n^2), worse than qsort.
Don't let Big O notation fool you, don't misunderstand Big O.
Don't let Big O notation fool you, don't misunderstand Big O.