This content originally appeared on DEV Community 👩‍💻👨‍💻 and was authored by Clean Code Studio
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The algorithm gets its name from the way smaller elements "bubble" to the top of the list.
def bubble_sort(arr):
n = len(arr)
for i in range(n):
for j in range(0, n-i-1):
if arr[j] > arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]
return arr
The time complexity of bubble sort is O(n^2).
Clean Code Studio ~ Python ~ Algorithms
This content originally appeared on DEV Community 👩‍💻👨‍💻 and was authored by Clean Code Studio
Clean Code Studio | Sciencx (2023-02-05T14:04:40+00:00) Bubble Sort (Python Algorithms). Retrieved from https://www.scien.cx/2023/02/05/bubble-sort-python-algorithms/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.