Grokking the Art of Recursion for Coding Interviews
Vote

0% completed

​

13. Quick Sort

Problem Statement

Write Recursive Approach for Quick Sort

Given an array of integers, sort it in ascending order using the Quick Sort algorithm.

Examples

Sr#Input ArrayOutputDescription
1[4, 2, 6, 8, 3][2, 3, 4, 6, 8]The array is sorted in ascending order.
2[10, 5, 3, 7, 2, 8, 6][2, 3, 5, 6, 7, 8, 10]The array is sorted in ascending order.

.....

.....

.....

Like the course? Get enrolled and start learning!
Pavel Kostenko

Pavel Kostenko

· a year ago

Would be great to remind us how quicksort works in the task description.

So we can get an idea, and start implementing it.

Otherwise we need to search the web. Not nice!