Fast algorithm implementation to sort very small list

by

For small arrays like this, you should probably look into sorting networks. As you can see on that page, insertion sort can be expressed as a sorting network. However, if you know the size of the array beforehand, you can devise an optimal network. Take a look at this site that can help you to find optimal sorting networks for a given size of array (though optimal is only guaranteed up to a size of 16 I believe). The comparators are even grouped together in operations that can be done in parallel. The comparators are essentially the same as your s(x,y) function though if you really want this to be fast, you shouldn’t be using min and max because then you’re doing twice the number of comparisons that are necessary.

If you need this sorting algorithm to work on a wide range of sizes, then you should probably just go with insertion sort as others have suggested.

More Related Contents:

  1. Fastest sort of fixed length 6 int array
  2. Can an array be grouped more efficiently than sorted?
  3. how to show time performance for merge sort? [closed]
  4. What should be the algorithm of the below statement?
  5. High-performance merging of ordered sets
  6. Is there an O(n) integer sorting algorithm?
  7. Why is quicksort better than mergesort?
  8. Which sort algorithm works best on mostly sorted data? [closed]
  9. Merge Sort a Linked List
  10. Quicksort: Choosing the pivot
  11. Natural Sorting algorithm
  12. Efficiency of purely functional programming
  13. Algorithm to separate items of the same type
  14. Compute the minimal number of swaps to order a sequence
  15. Time complexity of Sieve of Eratosthenes algorithm
  16. Which parallel sorting algorithm has the best average case performance?
  17. Quick Sort Vs Merge Sort [duplicate]
  18. How to rank a million images with a crowdsourced sort
  19. Efficient maths algorithm to calculate intersections
  20. Sort Four Points in Clockwise Order
  21. What is a bubble sort good for? [closed]
  22. Sorting in place
  23. How to calculate the index (lexicographical order) when the combination is given
  24. Faster version of find for sorted vectors (MATLAB)
  25. Quicksort superiority over Heap Sort
  26. Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
  27. When is each sorting algorithm used? [closed]
  28. Why is bubble sort O(n^2)?
  29. Find the pair across 2 arrays with kth largest sum
  30. Find the k largest elements in order

Leave a Comment