Approach 1: Heap
- Time:O(n\log k)
- Space:O(k)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Quick Select
- Time:O(n) \to O(n^2)
- Space:O(1)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 3: Quick Select with random pivot
- Time:O(n) (average)
- Space:O(1)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|