Please enable JavaScript.
Coggle requires JavaScript to display documents.
Quicksort, sorting algorithm that is based on the divide-and-conquer…
Quicksort
Situations
- Indices haven't crossed (i < j )
- Indices has crossed (i > j)
- Indices stop at the same element (i = j)
-
-
-
-
-
-
-
-
-
the subarray will be partitioned, exchange the pivot with A[j]
the value pointed is equal to the pivot
the subarray is partitioned, put the pivot next to the pointed element
-
-
-
-
-
method that uses the median of the leftmost, rightmost and middle element of the array
-