Question: programmer plans to use a sort algorithm known to be O( n 2 ). The project manager states that the algorithm is OK if it
programmer plans to use a sort algorithm known to be O(n2). The project manager states that the algorithm is OK if it will sort 2,000 records in less than one second on the target machine. The programmer does a simple test and finds that it takes 10 milliseconds to sort 100 records. Is the algorithm fast enough?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
