From 3913aa53f3e6b305cd0241a25c5689603aa4fbbf Mon Sep 17 00:00:00 2001
From: Krishnapal-rajput <72176093+Krishnapal-rajput@users.noreply.github.com>
Date: Mon, 3 Oct 2022 19:22:14 +0530
Subject: [PATCH] Sorting methods in Python3

Implemented all 3 main sorting methods in python 3.
---
 Sorting/Sorting.py | 109 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 109 insertions(+)
 create mode 100644 Sorting/Sorting.py

diff --git a/Sorting/Sorting.py b/Sorting/Sorting.py
new file mode 100644
index 0000000..86a3389
--- /dev/null
+++ b/Sorting/Sorting.py
@@ -0,0 +1,109 @@
+# Python3 program for Bubble Sort Algorithm Implementation
+def bubbleSort(arr):
+     
+    n = len(arr)
+ 
+    # For loop to traverse through all
+    # element in an array
+    for i in range(n):
+        for j in range(0, n - i - 1):
+             
+            # Range of the array is from 0 to n-i-1
+            # Swap the elements if the element found
+            #is greater than the adjacent element
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+                 
+# Driver code
+ 
+# Example to test the above code
+arr = [ 2, 1, 10, 23 ]
+ 
+bubbleSort(arr)
+ 
+print("Sorted array is:")
+for i in range(len(arr)):
+    print("%d" % arr[i])
+
+################################################Output:
+
+#Sorted array is:
+
+#  1
+#
+#  2
+#
+#  10
+#
+#  23
+
+#############################################################################################################################################################################################################################################
+
+
+# Selection Sort algorithm in Python
+def selectionSort(array, size):
+     
+    for s in range(size):
+        min_idx = s
+         
+        for i in range(s + 1, size):
+             
+            # For sorting in descending order
+            # for minimum element in each loop
+            if array[i] < array[min_idx]:
+                min_idx = i
+ 
+        # Arranging min at the correct position
+        (array[s], array[min_idx]) = (array[min_idx], array[s])
+ 
+# Driver code
+data = [ 7, 2, 1, 6 ]
+size = len(data)
+selectionSort(data, size)
+ 
+print('Sorted Array in Ascending Order is :')
+print(data)
+
+
+##################################Output:
+
+###############Sorted Array in Ascending Order is :
+
+###########[1, 2, 6, 7]
+
+#####################################################################################################################################################################################################################################################################
+
+# Creating a function for insertion sort algorithm
+def insertion_sort(list1): 
+   
+        # Outer loop to traverse on len(list1) 
+        for i in range(1, len(list1)): 
+   
+            a = list1[i] 
+   
+            # Move elements of list1[0 to i-1],
+            # which are greater to one position
+            # ahead of their current position 
+            j = i - 1 
+           
+            while j >= 0 and a < list1[j]: 
+                list1[j + 1] = list1[j] 
+                j -= 1 
+                 
+            list1[j + 1] = a 
+             
+        return list1 
+            
+# Driver code
+list1 = [ 7, 2, 1, 6 ] 
+print("The unsorted list is:", list1) 
+print("The sorted new list is:", insertion_sort(list1))
+
+
+#############Output:
+
+#########The unsorted list is: [7, 2, 1, 6]
+
+#########The sorted new list is: [1, 2, 6, 7]
+
+##########################################################################################################################################################################################################