Updated files

Author: larymak

Data Structures and Algorithms/binary_search.py renamed to Data Structures and Algorithms/Search Algorithms/binary_search.py

@@ -1,21 +1,21 @@
-
-def BubbleSort(array):
-
-    # Loop to access each array element
-    for i in range(len(array)):
-        for j in range(0,len(array)-1-i):
-            # Replace > with < for descending order
-            if array[j] > array[j+1]:
-
-                # Swapping elements if elements are not in the intended order
-                temp = array[j] 
-                array[j] = array[j+1]
-                array[j+1] = temp
-    return array
-
-
-# Driver code
-if __name__ == '__main__':
-    Array = [-1,9,21,34,1,5,6,8,10,23,25,27,31]
-    print("Array before sorting: ", Array)
+
+def BubbleSort(array):
+
+    # Loop to access each array element
+    for i in range(len(array)):
+        for j in range(0,len(array)-1-i):
+            # Replace > with < for descending order
+            if array[j] > array[j+1]:
+
+                # Swapping elements if elements are not in the intended order
+                temp = array[j] 
+                array[j] = array[j+1]
+                array[j+1] = temp
+    return array
+
+
+# Driver code
+if __name__ == '__main__':
+    Array = [-1,9,21,34,1,5,6,8,10,23,25,27,31]
+    print("Array before sorting: ", Array)
     print("Array after sorting: ", BubbleSort(Array))

Data Structures and Algorithms/binary_search_strings.py renamed to Data Structures and Algorithms/Search Algorithms/binary_search_strings.py

@@ -1,43 +1,43 @@
-
-def Heapify(Array, n, i):
-    # Find largest among root and children
-    largest = i
-    l = 2 * i + 1
-    r = 2 * i + 2
-
-    if l < n and Array[l] > Array[largest]:
-        largest = l
-
-    if r < n and Array[r] > Array[largest]:
-        largest = r
-
-    # If root is not largest, swap with largest and continue heapifying
-    if largest != i:
-        Array[i], Array[largest] = Array[largest], Array[i]
-        Heapify(Array, n, largest)
-    
-
-def HeapSort(Array):
-    n = len(Array)
-
-    # Build a max heap
-    for i in range(n//2, -1, -1):
-        Heapify(Array, n, i)
-
-    # One by one extract elements
-    for i in range(n-1, 0, -1):
-        # Swap
-        Array[i], Array[0] = Array[0], Array[i]
-
-        # Heapify root element
-        Heapify(Array, i, 0)
-
-
-if __name__ == "__main__":
-    Array = [-2, -3, -1, 11, 9, 12, 4, -5, -12, 6, 19, 20]
-    HeapSort(Array)
-    n = len(Array)
-    print("Sorted array is")
-    for i in range(n):
-        print("%d " % Array[i], end='')
+
+def Heapify(Array, n, i):
+    # Find largest among root and children
+    largest = i
+    l = 2 * i + 1
+    r = 2 * i + 2
+
+    if l < n and Array[l] > Array[largest]:
+        largest = l
+
+    if r < n and Array[r] > Array[largest]:
+        largest = r
+
+    # If root is not largest, swap with largest and continue heapifying
+    if largest != i:
+        Array[i], Array[largest] = Array[largest], Array[i]
+        Heapify(Array, n, largest)
+    
+
+def HeapSort(Array):
+    n = len(Array)
+
+    # Build a max heap
+    for i in range(n//2, -1, -1):
+        Heapify(Array, n, i)
+
+    # One by one extract elements
+    for i in range(n-1, 0, -1):
+        # Swap
+        Array[i], Array[0] = Array[0], Array[i]
+
+        # Heapify root element
+        Heapify(Array, i, 0)
+
+
+if __name__ == "__main__":
+    Array = [-2, -3, -1, 11, 9, 12, 4, -5, -12, 6, 19, 20]
+    HeapSort(Array)
+    n = len(Array)
+    print("Sorted array is")
+    for i in range(n):
+        print("%d " % Array[i], end='')
 

Data Structures and Algorithms/linear_search.py renamed to Data Structures and Algorithms/Search Algorithms/linear_search.py

@@ -1,18 +1,18 @@
-
-def insertionSort(Array):
-    for i in range(1, len(Array)):
-        key = Array[i]
-        j = i - 1
-
-        # Compare key with each element on the left of it until an element
-        #  smaller than it is found
-        # For descending order, change key<Array[j] to key>Array[j].
-        while j >= 0 and key < Array[j]:
-            Array[j + 1] = Array[j]
-            j -= 1
-        Array[j + 1] = key
-    return Array
-
-if __name__ == '__main__':
-    Array = [-2, -3, -1, 11, 9, 12, 4, -5, -12, 6, 19, 20]
+
+def insertionSort(Array):
+    for i in range(1, len(Array)):
+        key = Array[i]
+        j = i - 1
+
+        # Compare key with each element on the left of it until an element
+        #  smaller than it is found
+        # For descending order, change key<Array[j] to key>Array[j].
+        while j >= 0 and key < Array[j]:
+            Array[j + 1] = Array[j]
+            j -= 1
+        Array[j + 1] = key
+    return Array
+
+if __name__ == '__main__':
+    Array = [-2, -3, -1, 11, 9, 12, 4, -5, -12, 6, 19, 20]
     print(insertionSort(Array))