Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Selection Sort
Basic Accuracy: 48.8% Submissions: 20548 Points: 1

Given an unsorted array of size N, use selection sort to sort arr[] in increasing order by repeatedly selecting the minimum element from unsorted subarray and putting it in the sorted subarray.

Example 1:

Input :
N = 5
arr[] = {4, 1, 3, 9, 7}

Output: 1 3 4 7 9

Explanation:
Maintain sorted (in bold) and unsorted subarrays.
Select 1. Array becomes 1 4 3 9 7.
Select 3. Array becomes 1 3 4 9 7.
Select 4. Array becomes 1 3 4 9 7.
Select 7. Array becomes 1 3 4 7 9.
Select 9. Array becomes 1 3 4 7 9.

Example 2:

Input :
N = 10
arr[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1}

Output: 1 2 3 4 5 6 7 8 9 10

You dont need to read input or print anything. Complete the function select() which takes arr[] and starting point of unsorted array i as input parameters and returns the selected element for each iteration in selection sort.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Constraints:
1 ≤ N ≤ 10^3

to report an issue on this page.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?