Quicksort

Recursive divide-and-conquer.

sorting recursion divide-and-conquer

Implement `quicksort(nums: list[int]) -> list[int]`.

Return a new sorted list using the quicksort algorithm.

Constraints

0 ≤ len(nums) ≤ 10^4

Example

>>> quicksort([3,1,4,1,5,9,2,6])
[1,1,2,3,4,5,6,9]

25 points ~25 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

Choose pivot; partition into less/equal/greater; recurse and concatenate.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.