How can I optimize the bubble sort algorithm?

How can I optimize the bubble sort algorithm?

You can optimize bubble sort by adding a flag to check if any swaps were made during a pass. If no swaps occur, the array is sorted.

Can you show me a code example of that?

Sure! Here's a simple implementation in Python:

def optimized_bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        swapped = False
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
                swapped = True
        if not swapped:
            break
    return arr

What is the time complexity of this optimized version?

The average and worst-case time complexity remains O(n^2), but the best-case time complexity improves to O(n) when the array is already sorted.

Are there better sorting algorithms than bubble sort?

Yes, algorithms like quicksort, mergesort, and heapsort are generally more efficient than bubble sort for larger datasets.