From d32b5c051d0af9610c94a8b060747d7e03246087 Mon Sep 17 00:00:00 2001 From: karthik-S-2003 Date: Mon, 29 Dec 2025 17:36:02 +0530 Subject: [PATCH] sorting added --- searching/sorting/bubble.py | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 searching/sorting/bubble.py diff --git a/searching/sorting/bubble.py b/searching/sorting/bubble.py new file mode 100644 index 0000000..037541b --- /dev/null +++ b/searching/sorting/bubble.py @@ -0,0 +1,29 @@ +# Optimized Python program for implementation of Bubble Sort +def bubbleSort(arr): + n = len(arr) + + # Traverse through all array elements + for i in range(n): + swapped = False + + # 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] + swapped = True + if (swapped == False): + break + +# Driver code to test above +if __name__ == "__main__": + arr = [64, 34, 25, 12, 22, 11, 90] + + bubbleSort(arr) + + print("Sorted array:") + for i in range(len(arr)): + print("%d" % arr[i], end=" ")