Updated to conform black's styling.

Author: lcgabaldon

src/python/counting_sort.py

@@ -4,7 +4,7 @@
 
 
 def counting_sort(arr):
-    """ Finding the max element in the list """
+    """Finding the max element in the list"""
     k = max(arr) + 1
 
     """ Initialing count array of len k with 0's """

src/python/doubly_linked_list.py

@@ -21,7 +21,7 @@ def __init__(self, data, prev, next):
 class DoublyLinkedList:
     head = None
     tail = None
-    
+
     def append(self, data):
         # Creates a new node pointing to None (prev and next)
         new_node = Node(data, None, None)
@@ -34,13 +34,12 @@ def append(self, data):
             # For a non-empty list, adjust pointers to add the new node at the end
             new_node.prev = self.tail  # New node's prev points to the current tail
             self.tail.next = new_node  # Current tail's next points to the new node
-            self.tail = new_node       # Update tail to be the new node
+            self.tail = new_node  # Update tail to be the new node
 
         # No additional 'new_node.next = None' is needed as it's already None by default
 
-
     def delete(self, data):
-        """ Deletes a node from the list """
+        """Deletes a node from the list"""
         """ Current node is first node in the list"""
         curr_node = self.head
 
@@ -71,7 +70,7 @@ def delete(self, data):
             curr_node = curr_node.next
 
     def display(self):
-        """ Displays all data in the list"""
+        """Displays all data in the list"""
         print("Doubly Linked List: ")
 
         # Current node is head of the list

src/python/fibonacci_recursive.py

@@ -12,7 +12,7 @@ def fibonacci(number):
     """
     Recursive Fibonacci
     """
-    
+
     if number < 2:
         return number
     return fibonacci(number - 1) + fibonacci(number - 2)

src/python/insertion_sort.py

@@ -57,7 +57,7 @@ def insertion_sort_recursive(vector, index):
     list2 = [8, 1, 3, 5, 7, 9, 0, 2, 4, 6]
     print("Unsorted list: ")
     print(list2)
-    
+
     list2 = insertion_sort_recursive(list2, 1)
     print("Sorted list with recursive insertion sort: ")
     print(list2)

src/python/quick_sort.py

@@ -2,14 +2,14 @@
 
 
 def swap(a_list, pos1, pos2):
-    """ Swaps the position of two items in a list """
+    """Swaps the position of two items in a list"""
     temp = a_list[pos1]
     a_list[pos1] = a_list[pos2]
     a_list[pos2] = temp
 
 
 def partition(a_list, start, end):
-    """ Splits a list """
+    """Splits a list"""
     pivot = a_list[start]
     while True:
         while a_list[start] < pivot:
@@ -28,7 +28,7 @@ def partition(a_list, start, end):
 
 
 def quick_sort(a_list, start, end):
-    """ Quick sort algorithm """
+    """Quick sort algorithm"""
     if start < end:
         part = partition(a_list, start, end)
         quick_sort(a_list, start, part)