21. When people manually sort cards in a bridge hand, most use a method that is similar to insertion sort . 22. Bubble sort and insertion sort can be interpreted as particular instances of this procedure to put a sequence into order. 23. Compared to basic insertion sort , the drawback of library sort is that it requires extra space for the gaps. 24. Experimental results such as those of Astrachan have also shown that insertion sort performs considerably better even on random lists. 25. As long as the data is uniformly distributed, class sizes will be consistent and insertion sort will be computationally efficient. 26. A variant of this scheme runs quicksort with a constant cutoff, then runs a single insertion sort on the final array: 27. On the other hand, insertion sort considers one input element per iteration and produces a partial solution without considering future elements. 28. With either algorithm, one would usually revert to something like insertion sort when the number of sorted items gets small enough. 29. If you use insertion sort , your complexity is O ( n 2 ), not O ( n log n ). 30. Other algorithms, such as library sort, a variant of insertion sort that leaves spaces, are also practical for physical use.
