CSIS-385: Analysis of Algorithms

see the PowerPoint Presentation Chapter 6: Sorting. pp 239-241: Insertion Sort. O(n2) but very efficient on partially sorted list. pp 243-252: Quicksort ***** O(n log n) on average, but O(n2) worst case. pick a good pivot helps avoids worst case, but not always. pp 254-259: Lower-bound . Ω(n log n) is the fastest we can sort using direct ... ................
................