Algorithm Design Questions
The bubble sort algorithm is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the entire list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list during each iteration. The time complexity of bubble sort is O(n^2) in the worst and average case, making it inefficient for large lists.