Teaching BPSC 4.0 बिहार उच्च माध्यमिक शिक्षक भर्ती (PGT) 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
More than one of the above
5
None of the above