quicksort
-
QuicksortAlgoDS/Algorithm 2020. 1. 16. 22:58
1. Overview Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways. Always pick the first element as a pivot. Always pick the last element as the pivot (implemented below) Pick a random element as pivot. Pick the median as a ..