⚡ Added bubble sort, insertion sort, selection sort

Author: deutranium

sortingAlgo/bubbleSort/bubbleSort.py

@@ -0,0 +1,15 @@
+# Testcase
+arr = [1, 63, 103, 3, 8, 74, 76, 37, 71, 66]
+lMinusOne = len(arr) - 1
+
+def bubbleSort(arr):
+	while True:
+		swapped = False
+		for i in range(lMinusOne):
+			if arr[i] > arr[i + 1]:
+				swapped = True
+				arr[i], arr[i + 1] = arr[i + 1], arr[i]
+		if swapped == False:
+			return arr
+
+print(bubbleSort(arr))

sortingAlgo/insertionSort/insertionSort.py

@@ -0,0 +1,16 @@
+# Testcase
+arr = [1, 63, 103, 3, 8, 74, 76, 37, 71, 66]
+l = len(arr)
+
+def insertionSort(arr):
+	for i in range(1,l):
+		if arr[i] < arr[i - 1]:
+			for j in range(i):
+				if arr[i] < arr[j]:
+					x = arr[i]
+					del arr[i]
+					arr.insert(j, x)
+	return arr
+
+print(insertionSort(arr))
+

sortingAlgo/selectionSort/selectionSort.py

@@ -0,0 +1,16 @@
+# Testcase
+arr = [63, 1, 103, 3, 8, 74, 76, 37, 71, 66]
+l = len(arr)
+
+def selectionSort(arr):
+	for i in range(l):
+		idx = i
+		iPlusOne = i + 1
+		for j in range(iPlusOne, l):
+			if arr[j] < arr[idx]:
+				idx = j
+
+		arr[i], arr[idx] = arr[idx], arr[i]
+	return arr
+
+print(selectionSort(arr))