algorithms/sort/bubble_sort.py at master · BeFreeB/algorithms · GitHub

28 lines (20 loc) · 533 Bytes

"""

https://en.wikipedia.org/wiki/Bubble_sort

Worst-case performance: O(N^2)

"""

def bubble_sort(arr):

def swap(i, j):

arr[i], arr[j] = arr[j], arr[i]

n = len(arr)

swapped = True

while swapped:

swapped = False

for i in range(1, n):

if arr[i - 1] > arr[i]:

swap(i - 1, i)

swapped = True

array = [1, 5, 65, 23, 57, 1232, -1, -5, -2, 242, 100,

4, 423, 2, 564, 9, 0, 10, 43, 64, 32, 1, 999]

print(array)

bubble_sort(array)

print(array)

Expand file tree