Question: This is all one question 2. A programmer plans to use a sort algorithm known to be O(n^). The project manager states that the algorithm

This is all one question
2. A programmer plans to use a sort algorithm known to be O(n^). 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. 1 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
