Bubble sort, selection sort and insertion sort all have a time complex…

Question

Bubble sort, selection sort and insertion sort all have a time complexity of:

Accepted Answer

D. n squared

1. Each of the three programs contains a nested loop.
2. A nested loop gives a squared cost.
3. So all three run in n squared time.
_Source: syllabus Computer Science Class XII, Chapter 5, Sorting._

Answer

n plus n

Answer

n over n

Answer

n minus n

Bubble sort, selection sort and insertion sort all have a time complexity of:

Keep practising Sorting Algorithms