Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons

by

Compare A to B and C to D. WLOG, suppose A>B and C>D.
Compare A to C. WLOG, suppose A>C.
Sort E into A-C-D. This can be done with two comparisons.
Sort B into {E,C,D}. This can be done with two comparisons, for a total of seven.

More Related Contents:

  1. C++ Sorting Algorithms [closed]
  2. Priority scoring algorithm [closed]
  3. What should be the algorithm of the below statement?
  4. Efficient way to add element to sorted datastructure [closed]
  5. How can I pair socks from a pile efficiently?
  6. Fastest sort of fixed length 6 int array
  7. Is there an O(n) integer sorting algorithm?
  8. Why is quicksort better than mergesort?
  9. Which sort algorithm works best on mostly sorted data? [closed]
  10. Merge Sort a Linked List
  11. Natural Sorting algorithm
  12. Algorithm to separate items of the same type
  13. Compute the minimal number of swaps to order a sequence
  14. Which parallel sorting algorithm has the best average case performance?
  15. Optimal algorithm for returning top k values from an array of length N
  16. Quick Sort Vs Merge Sort [duplicate]
  17. How to rank a million images with a crowdsourced sort
  18. Sort Four Points in Clockwise Order
  19. What is a bubble sort good for? [closed]
  20. Sorting in place
  21. Faster version of find for sorted vectors (MATLAB)
  22. Quicksort superiority over Heap Sort
  23. Can an array be grouped more efficiently than sorted?
  24. Search a sorted 2D matrix [duplicate]
  25. When is each sorting algorithm used? [closed]
  26. Comparison-based ranking algorithm
  27. Why is bubble sort O(n^2)?
  28. Find the pair across 2 arrays with kth largest sum
  29. Stable separation for two classes of elements in an array
  30. Find the k largest elements in order

Leave a Comment