What is the time complexity of the bubble sort algorithm?

Algorithm Design Questions Medium



49 Short 51 Medium 39 Long Answer Questions Question Index

What is the time complexity of the bubble sort algorithm?

The time complexity of the bubble sort algorithm is O(n^2), where n is the number of elements in the array being sorted. This means that the time it takes to sort the array increases quadratically with the number of elements.