Selection Sort
1. Which one of the following is an example of an unsorted array?
2. Suppose an algorithm goes through each element of an array twice. What is the time complexity of the algorithm? (N: the size of the array)
3. Which of the following is false about the array?
4. Sorting an array makes searching faster.
5. What is the time complexity of the following algorithm? for i = 0; i < n; i++ for j = i+1; j < n; j++ for k = j+1; k < n; k++ printf(array[(i+j+k)%n])