June 24, 2019
Cant be said as size of K is unknown
Both will be equal
Cant be determined as the size of K is not known.
Please login to submit your explanation
You can check your performance of this question after Login/Signup
Cant be said
ω(n^4) as it is omega is measured for best time complexity
Quick sort has worse time complxity of O(n^2)
check - https://prepinsta.com/time-complexities-placements/
Radix sort is quickest amongst these in average time
Two for loops thus, Theta (n^2)
Theta( log n)
Theta(n log n)
Theta(n) will be the answer
Amount of hard disk space required to store the program.
Amount of hard disk space required to compile the program.
Amount of memory required by the program to run.
Amount of memory required by the program to compile.
Space complexity is a measure of the amount of working storage an algorithm needs. That means how much memory, in the worst case, is needed at any point in the algorithm. As with time complexity, we're mostly concerned with how the space needs grow, in big-Oh terms, as the size N of the input problem grows.
Please login to report
Login/Signup to comment