Question: Is this correct for finding big o and calculating the cost and time for the counting-sort algorithm? If not, please explain why and what's wrong.
Is this correct for finding big o and calculating the cost and time for the counting-sort algorithm? If not, please explain why and what's wrong. When I add it up I get 4n + 4k -5 = o(n + k)

Cost Time Counting-sort(A, B, Let C[e...K] be a new array for i- 0 to k k) C1 C2 C3 for j-1 to A.length or n for i- 1 to k for j-n or A.length down to 1 C5 C6 C7 C9 C10 C11
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
