Teaching Rajasthan Basic Computer Instructor 2021 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
A measure of the amount of memory needed for an algorithm to execute is called:
1
time efficiency
2
functional efficiency
3
space efficiency
4
amortised efficiency