Redirecting to
NADOS

Quick Select

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given an array(arr) of integers.
2. You have to find the k-th smallest element in the given array using the quick-select algorithm.
Input Format
An Integer n 
arr1
arr2..
n integers
An integer k
Output Format
Check the sample output and question video.
Question Video
Constraints
1 <= N <= 100000
-10^9 <= arr[i] <= 10^9
1 <= k <= N
Sample Input
5
7
-2
4
1
3
3
Sample Output
pivot -> 3
Swapping -2 and 7
Swapping 1 and 7
Swapping 3 and 4
pivot index -> 2
3


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name