From d564556a79f759d14bfed1c540c5cf62e7470a14 Mon Sep 17 00:00:00 2001
From: Niraj Dhalani <32194632+nirajdhalani@users.noreply.github.com>
Date: Tue, 20 Oct 2020 21:36:20 +0530
Subject: [PATCH] Create bubblesort.py

Python Program for Bubble Sort
---
 bubblesort.py | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 bubblesort.py

diff --git a/bubblesort.py b/bubblesort.py
new file mode 100644
index 0000000..54f5dee
--- /dev/null
+++ b/bubblesort.py
@@ -0,0 +1,27 @@
+
+# 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]),