#032Quicksort Always Picks First Element on Sorted Input
dsa.hardDSA
1def quicksort(arr, low, high):
2 if low < high:
3 pivot = arr[low]
4 i = low - 1
5 for j in range(low, high + 1):
6 if arr[j] <= pivot:
7 i += 1
8 arr[i], arr[j] = arr[j], arr[i]
9 arr[i + 1], arr[high] = arr[high], arr[i + 1]
10 pi = i + 1
11 quicksort(arr, low, pi - 1)
12 quicksort(arr, pi + 1, high)
no lines flagged
#032PracticeHard30 min · 200 XP
Quicksort Always Picks First Element on Sorted Input
This quicksort implementation has O(n²) worst-case performance on already-sorted arrays in production.
Flagged lines
No lines flagged yet
What's wrong?
Flag a line or write a note to submit.