# insertion sort in a sentence

- So any kind of
*insertion sort* won't work well. - Bubble sort is a stable sort algorithm, like
*insertion sort*. - The average case for
*insertion sort* is O ( n 2 ). - I then use two for loops and do
*insertion sort*. *Insertion sort* is then applied to the classified set.- It's difficult to find
*insertion sort* in a sentence. - So, for fewer than 64 elements, Timsort reduces to an
*insertion sort*. - However,
*insertion sort* provides several advantages: - Thus
*insertion sort* is an online algorithm. - My experience is that humans use an
*insertion sort* or bubble sort for short lists. - The average case is also quadratic, which makes
*insertion sort* impractical for sorting large arrays. - So, I echo the above and recommend an
*insertion sort* for most human sorting needs. - If you knew the array was almost sorted, wouldn't you simply
*insertion sort*? *Insertion sort* is still recommended, though, for its situational performance and lack of recursion.*Insertion sort* iterates, consuming one input element each repetition, and growing a sorted output list.- Arguably, when you are not born a recursive thinker,
*insertion sort* is easier than mergesort.