In the problem 9, what if there are repetitions allowed and you need to find the index of the first occurrence of the element in the rotated-sorted list.

problem 9

Write pros and cons of Heap-Sort, Merge-Sort and Quick-Sort.

//Sorts a given list by selection sort //Input: An array A[0..n-1] of orderable elements. //Output: List A[0..n-1] sorted in ascending order Algorithm SelectionSort (A[0..n-1]) for i=0 to n - 2 do min = i for j = i + 1 to n - 1 do if A[j] A[min] min = j swap A[i] and A[min]