Is there ever a good reason to use Insertion Sort?

by

From http://www.sorting-algorithms.com/insertion-sort:

Although it is one of the elementary sorting algorithms with
O(n2) worst-case time, insertion sort
is the algorithm of choice either when
the data is nearly sorted (because it
is adaptive) or when the problem size
is small (because it has low
overhead).

For these reasons, and because it is also stable, insertion sort is
often used as the recursive base case
(when the problem size is small) for
higher overhead divide-and-conquer
sorting algorithms, such as merge sort
or quick sort.

More Related Contents:

  1. What is a plain English explanation of “Big O” notation?
  2. What exactly does big Ө notation represent?
  3. How to determine the longest increasing subsequence using dynamic programming?
  4. Unique (non-repeating) random numbers in O(1)?
  5. How do I calculate a point on a circle’s circumference?
  6. Algorithm for Additive Color Mixing for RGB Values
  7. Algorithm to generate all possible permutations of a list?
  8. Fast permutation -> number -> permutation mapping algorithms
  9. Algorithm to detect intersection of two rectangles?
  10. An efficient compression algorithm for short text strings [closed]
  11. circle-circle collision
  12. Generating the partitions of a number
  13. How to detect the BPM of a song in php [closed]
  14. Find the shortest path in a graph which visits certain nodes
  15. How do you validate a binary search tree?
  16. Algorithm to separate items of the same type
  17. how to calculate binary search complexity
  18. What string similarity algorithms are there?
  19. Combined area of overlapping circles
  20. Argument for O(1) average-case complexity of heap insertion
  21. insert, delete, max in O(1)
  22. “Rounding” colour values to the nearest of a small set of colours
  23. What algorithm can calculate the power set of a given set?
  24. Color gradient algorithm
  25. Convert light frequency to RGB?
  26. What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?
  27. Why use binary search if there’s ternary search?
  28. Bridges in a connected graph
  29. Breadth First Search and Depth First Search
  30. Portable efficient alternative to PDEP without using BMI2?

Leave a Comment