Sorting

• In previous classes several techniques for sorting data were presented.

• O(n2) and O(n lg(n)) were shown to be possible

• Quicksort and mergesort were shown to be O(n lg(n))

  • Quicksort is generally slightly more efficient both in terms of memory consumption and in terms of speed.
  • But... a modification of merge sort will allow you to sort arbitrarily large files of information.