Bubble Sort: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

13 May 2023

12 May 2023

  • curprev 05:3305:33, 12 May 2023Admin talk contribs 2,438 bytes +2,438 Created page with "Bubble Sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements if they are in the wrong order. It is an elementary sorting algorithm that is not suitable for large datasets due to its high time complexity. The algorithm is named "Bubble Sort" because the smaller elements "bubble" to the beginning of the list, while the larger elements "sink" to the end. == Algorithm == The Bubble Sort algorithm works as follows: Start at the beginnin..."