Which is/are complexities of their corresponding algorithms?
1
Towers of Hanoi with n disks → Θ (2n )
2
Addition of two n × m matrices → Θ ( n × m )
3
Heap sort given n numbers at the worst case → Θ (n2 )
4
Binary search given n sorted numbers at the worst case → Θ (n)