Radix Sort
1. Pick the equivalent of log100
2. If each element of the array is traversed N (size of the array) times, what is the time complexity of the algorithm?
3. Pick the correct option
4. What's the complexity of searching a number in an unsorted array?
5. Space complexity refers to the amount of memory taken by the algorithm in asymptotic notation