Sorting

Selection sort- it is a O(n^2) technique to sort an array in ascending order. Working: We take two pointers that traverse through the array. Pointer 1 : slow - runs n times Pointer 2: fast - runs [(n(n+1))/2] times. pointer 2 find the element contain...