Sorting and Selection

Sorting and Selection

1. Quick-Sort

   • Based on the divide-and-conquer paradigm
     • Input sequences processed
     • Output sequences generated
   • Running time
     • O(n log n) Worst case time: O(n**2)
   • Randomized Quick-Sort
     • Picking Pivots at Random
       • Pick an element of the sequence at random as the pivot, keeping the rest of the algorithm unchanged

Bilder und Dateien der Mindmap