BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 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
5
Non functional efficiency