We want to sort an array with n elements. Quick-sort does this by breaking up the array into non-overlapping segments, sorting them separately and then combining the results.
Part of course:
Quick-sort: Video tutorial, pseudo-code (and in-place sorting)