- Time complexity:
- Best: Ω(n log(n))
- Average: Θ(n log(n))
- Worst: O(n^2) -> When the pivot is the smallest or largest element
- Space complexity:
- Best: Ω(log(n))
- Average: Θ(log(n))
- Worst: O(n)
- In-place
- Unstable
-
Notifications
You must be signed in to change notification settings - Fork 0
Algorithms and Data Structures - Quick Sort
License
NelsonBN/algorithms-data-structures-quick-sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms and Data Structures - Quick Sort