Determine the computing time T(n) for the algorithm to find the highest item within an array of items. Set high = 0 Set loc = 0 While loc < n do the following If a[loc]> high then Set high = a[loc] Increment loc by 1 End While Instructions Display high TOTAL Number

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for examp…