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

1. All three compare elements pairwise across repeated passes. 2. The work therefore grows with the square of the size. 3. Bubble sort, selection sort and insertion sort all have a time complexity of n squared. 4. So the answer is n squared. _Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_