Divide-and-conquer. Need to mention average time complexity (O(nlog(n)) and space complexity (constant). Worse case can be O(n^2) if the array is already sorted. Shuffling is usually done in production quick sort.