Geeks for Geeks: Time Complexities of all Sorting Algorithms

Efficiency of an algorithm depends on two parameters, which are time and space complexity. Both are calculated as the function of input size(n).