What is the time complexity of bubble sort in C++?

What is the time complexity of bubble sort in C++?

The time complexity of bubble sort in C++ is O(n^2) in the average and worst cases, and O(n) in the best case when the array is already sorted.

Why is bubble sort considered inefficient compared to other sorting algorithms?

Bubble sort is inefficient because it repeatedly steps through the list, comparing adjacent elements and swapping them if they are in the wrong order, leading to a high number of comparisons and swaps.

Are there any scenarios where bubble sort is useful?

Yes, bubble sort can be useful for small datasets or when the data is nearly sorted, as its implementation is simple and it can be optimized to stop early if no swaps are made.

Can you show me a simple implementation of bubble sort in C++?

Sure! Here's a simple implementation:

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                std::swap(arr[j], arr[j+1]);
            }
        }
    }
}