Q. Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively. (Solved)
1. 0(log n), 0(log n), o(log n)
2. o(n2), o(n2), o(n2)
3. o(n2), o(n log n), o(n log n)
4. o(n log n), o(n2), o(n log n)
- b. o(n2), o(n2), o(n2)