sorting

Author: mohanakrishnavh

Sorting/bubble_sort.py

@@ -0,0 +1,27 @@
+'''
+Selction Sort
+
+Time Complexity : O(n^2)
+Best Case : O(n)
+Average Case : O(n^2)
+Worst Case : O(n^2)
+
+Space Complexity : O(1)
+'''
+
+
+def bubble_sort(A):
+    n = len(A)
+    for k in range(1, n):
+        flag = 0
+        for i in range(0, n-k):
+            if A[i] > A[i+1]:
+                A[i], A[i+1] = A[i+1], A[i]
+                flag = 1
+
+        if flag == 0:
+            break
+    return A
+
+A = [2, 7, 4, 1, 5, 3]
+print(bubble_sort(A))

Sorting/insertion_sort.py

@@ -0,0 +1,25 @@
+'''
+Insertion Sort
+
+Time Complexity : O(n^2)
+Best Case : O(n)
+Average Case : O(n^2)
+Worst Case : O(n^2)
+
+Space Complexity : O(1)
+'''
+
+
+def insertion_sort(A):
+    n = len(A)
+    for i in range(1, n):
+        value = A[i]
+        hole = i
+        while hole > 0 and A[hole - 1] > value:
+            A[hole] = A[hole - 1]
+            hole -= 1
+        A[hole] = value
+    return A
+
+A = [2, 7, 4, 1, 5, 3]
+print(insertion_sort(A))

Sorting/MergeSort.py renamed to Sorting/merge_sort.py

@@ -0,0 +1,21 @@
+'''
+Selction Sort
+
+Time Complexity : O(n^2)
+Space Complexity : O(1)
+'''
+
+
+def selection_sort(A):
+    n = len(A)
+    for i in range(0, n-1):
+        i_min = i
+        for j in range(i+1, n):
+            if A[j] < A[i_min]:
+                i_min = j
+
+        A[i], A[i_min] = A[i_min], A[i]
+    return A
+
+A = [2, 7, 4, 1, 5, 3]
+print(selection_sort(A))