You are given an array students containing n unique student IDs in the range [0, n]. One student is absent, so exactly one ID is missing from the array. Return the missing student ID.

Note:

You must implement the solution using the Selection Sort algorithm.

Do not use any built-in sort functions.

Example 1:

Input: students = [2,0,4,1]
Output: 3
Explanation:
n = 4, since there are 4 students, meaning all student IDs fall within the range [0,4]. The missing student ID is 3, as it is not present in the given student array.

Example 2:

Input: students = [0,1]
Output: 2
Explanation:
n = 2, since there are 2 students, meaning all student IDs fall within the range [0,2]. The missing student ID is 2, as it does not appear in the given student array.

Example 3:

Input: students = [8,4,6,2,0,5,3,1]
Output: 7
Explanation:
n = 8 since there are 8 students, meaning all student IDs fall within the range [0,8]. The missing student ID is 7, as it is not present in the given student array.

Constraints

n == students.length

1 <= n <= 10⁴

0 <= students[i] <= n

All the student IDs in students are distinct

Exactly one ID in the range [0, n] is missing

47. Missing Student (Selection sort)