Suppose we are sorting an array A of n integers, with each integer between 0 and n^4 + 22. a) Give a Θ bound for the run
Posted: Sun Jul 03, 2022 11:24 am
Suppose we are sorting an array A of n integers, with eachinteger between 0 and n^4 + 22.
a) Give a Θ bound for the running time of counting sort on thedescribed input. (Give reasoning for your answer.)
b) Describe an algorithm to sort the integers in Θ(n) time.(Give reasoning for your answer.)
a) Give a Θ bound for the running time of counting sort on thedescribed input. (Give reasoning for your answer.)
b) Describe an algorithm to sort the integers in Θ(n) time.(Give reasoning for your answer.)