Update BubbleSort.py

Author: source-ct

DSA/DSA-python/Sorting Algo/BubbleSort.py

@@ -1,20 +1,14 @@
-#this is the most easiest algorith which jst involves swapping of elements
-import array 
-def BubbleSort(a):
-      n = len(a)
-
-      for i in range(n):
-            for j in range(i+1 , n):
-                  if(a[i]>a[j]):
-                        a[i] ,  a[j] = a[j] , a[i]
-
-a = array.array('i' , [])
-
-n = int(input("Enter lenght of array  : "))
-
-for i in range(n):
-      c = int(input("Enter the number : "))
-      a.append(c)
-
-BubbleSort(a)
-print(list(a))
+def bubbleSort(lst):
+    n = len(lst)
+ 
+    for i in range(n-1):
+ 
+        for j in range(0, n-i-1):
+ 
+           
+            if lst[j] > lst[j + 1] :
+                lst[j], lst[j + 1] = lst[j + 1], lst[j]
+ 
+lst = [64, 34, 25, 12, 22, 11, 90]
+ 
+bubbleSort(lst)