Data Structures :: Complexity - Discussion
7 / 48
Algorithms A and B solve the same problem. Time complexity of A is in O(n^2) and that of B is in O(n). Which among the following can you guarantee?
AA is having less executable instructions than B
BA is having more number of functions than B
CA is having less number of functions than B
DA is having more executable instructions than B