From 9d72d11063593c6c3b5d57240a431e58d7207014 Mon Sep 17 00:00:00 2001 From: tushar ulhare Date: Thu, 24 Oct 2019 11:20:17 +0530 Subject: [PATCH] Create BubbleSort.py Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order. --- BubbleSort.py | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 BubbleSort.py diff --git a/BubbleSort.py b/BubbleSort.py new file mode 100644 index 0000000..f801e2f --- /dev/null +++ b/BubbleSort.py @@ -0,0 +1,19 @@ + +def bubbleSort(arr): + n = len(arr) + + + for i in range(n): + + for j in range(0, n-i-1): + + if arr[j] > arr[j+1] : + arr[j], arr[j+1] = arr[j+1], arr[j] + +arr = [64, 34, 25, 12, 22, 11, 90] + +bubbleSort(arr) + +print ("Sorted array is:") +for i in range(len(arr)): + print ("%d" %arr[i]),