An algorithm that should run in O(n log n) time complexity runs significantly slower.The likely cause is: - Study24x7
Social learning Network
2 followers study24x7 01 Jul 2024 12:17 PM study24x7 study24x7

An algorithm that should run in O(n log n) time complexity runs significantly slower.
See more

A

Incorrect base case in recursion

B

Excessive memory allocation

C

Poor choice of pivot in sorting

D

All of the above

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles