From 7e7206aeb0a3aafdc8a0b1d34832a452550e7e87 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Kaan=20Ar=C4=B1?= Date: Wed, 27 Oct 2021 12:10:07 +0300 Subject: [PATCH] Create bubble_sort.py --- bubble_sort.py | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 bubble_sort.py diff --git a/bubble_sort.py b/bubble_sort.py new file mode 100644 index 0000000..75f51af --- /dev/null +++ b/bubble_sort.py @@ -0,0 +1,26 @@ +# Python program for implementation of Bubble Sort + +def bubbleSort(arr): + n = len(arr) + + # Traverse through all array elements + for i in range(n-1): + # range(n) also work but outer loop will repeat one time more than needed. + + # Last i elements are already in place + for j in range(0, n-i-1): + + # traverse the array from 0 to n-i-1 + # Swap if the element found is greater + # than the next element + if arr[j] > arr[j + 1] : + arr[j], arr[j + 1] = arr[j + 1], arr[j] + +# Driver code to test above +arr = [64, 34, 25, 12, 22, 11, 90] + +bubbleSort(arr) + +print ("Sorted array is:") +for i in range(len(arr)): + print ("% d" % arr[i]),