subject: Data Structures and Algorithms

Q6. (Points 7+2+1) (a) Compute the running time complexity of the given code? (b) Is it possible to optimize this code for best case, if yes then how? (c) What would be the worst case Time Complexity of this code? ALGORITHM Selection Sort(A[O..n 1]) //Sorts a given array by selection sort //Input: An array A[O..n array A[0..n - 1] of orderable elements //Output: Array A[O..n 1) sorted in nondecreasing order for it to n - 2 do min ti for it i+ 1 to n - 1 do if A[j]