In given list of n elements, we need to find the first repeated element.

Which of the following methods will work for us. If a method works, then implement it.

• Brute force exhaustive search.

• Use Hash-Table to keep an index of the elements and use the second scan to find the element.

• Sorting the elements.

• If we know the range of the element then we can use counting technique.

When order in which elements appear in input is important, we cannot use sorting.

//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]