Question: You are given an array A of integers. Create an algorithm that can sort array A in O(n+b-c) time, where c is the minimum integer
You are given an array A of integers. Create an algorithm that can sort array A in O(n+b-c) time, where c is the minimum integer of A and b is the maximum integer in A. What is the running time? Explain why
(n log n) doesn't apply here.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
