quick sort

Jump to bottom

Lovro edited this page Oct 4, 2019 · 1 revision

Overview

in-place sorting
faster than merge and heap sort
comparison sort (define relation <)
not stable sort
n items: O(nlog(n)) average or O(n2) worst
divide and conquer