You are given an array A of integers. Create an algorithm thatcan sort array A in O(n+b-c) time, where c is the minimum integerof A and b is the maximum integer in A. What is the running time?Explain why
(n log n) doesn’t apply here.
Expert Answer
An answer will be send to you shortly. . . . .