isort --profile black . (TheAlgorithms#2181)

* updating DIRECTORY.md

* isort --profile black .

* Black after

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

Author: cclauss

.github/workflows/autoblack.yml

@@ -17,7 +17,7 @@ jobs:
         if: failure()
         run: |
           black .
-          isort --profile black --recursive .
+          isort --profile black .
           git config --global user.name github-actions
           git config --global user.email '${GITHUB_ACTOR}@users.noreply.github.com'          
           git remote set-url origin https://x-access-token:${{ secrets.GITHUB_TOKEN }}@github.com/$GITHUB_REPOSITORY

DIRECTORY.md

@@ -253,6 +253,7 @@
   * [Finding Bridges](https://github.com/TheAlgorithms/Python/blob/master/graphs/finding_bridges.py)
   * [Frequent Pattern Graph Miner](https://github.com/TheAlgorithms/Python/blob/master/graphs/frequent_pattern_graph_miner.py)
   * [G Topological Sort](https://github.com/TheAlgorithms/Python/blob/master/graphs/g_topological_sort.py)
+  * [Gale Shapley Bigraph](https://github.com/TheAlgorithms/Python/blob/master/graphs/gale_shapley_bigraph.py)
   * [Graph List](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_list.py)
   * [Graph Matrix](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_matrix.py)
   * [Graphs Floyd Warshall](https://github.com/TheAlgorithms/Python/blob/master/graphs/graphs_floyd_warshall.py)
@@ -596,6 +597,7 @@
 
 ## Searches
   * [Binary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
+  * [Double Linear Search](https://github.com/TheAlgorithms/Python/blob/master/searches/double_linear_search.py)
   * [Fibonacci Search](https://github.com/TheAlgorithms/Python/blob/master/searches/fibonacci_search.py)
   * [Hill Climbing](https://github.com/TheAlgorithms/Python/blob/master/searches/hill_climbing.py)
   * [Interpolation Search](https://github.com/TheAlgorithms/Python/blob/master/searches/interpolation_search.py)

arithmetic_analysis/in_static_equilibrium.py

@@ -6,9 +6,10 @@
 mypy : passed
 """
 
-from numpy import array, cos, sin, radians, cross  # type: ignore
 from typing import List
 
+from numpy import array, cos, cross, radians, sin  # type: ignore
+
 
 def polar_force(
     magnitude: float, angle: float, radian_mode: bool = False

arithmetic_analysis/newton_raphson.py

@@ -2,9 +2,9 @@
 # Author: Syed Haseeb Shah (github.com/QuantumNovice)
 # The Newton-Raphson method (also known as Newton's method) is a way to
 # quickly find a good approximation for the root of a real-valued function
-
 from decimal import Decimal
 from math import *  # noqa: F401, F403
+
 from sympy import diff
 
 

ciphers/hill_cipher.py

@@ -35,8 +35,8 @@
 https://www.youtube.com/watch?v=4RhLNDqcjpA
 
 """
-
 import string
+
 import numpy
 
 

ciphers/playfair_cipher.py

@@ -1,5 +1,5 @@
-import string
 import itertools
+import string
 
 
 def chunker(seq, size):

compression/burrows_wheeler.py

@@ -10,7 +10,7 @@
 original character. The BWT is thus a "free" method of improving the efficiency
 of text compression algorithms, costing only some extra computation.
 """
-from typing import List, Dict
+from typing import Dict, List
 
 
 def all_rotations(s: str) -> List[str]:

computer_vision/harriscorner.py

@@ -1,5 +1,5 @@
-import numpy as np
 import cv2
+import numpy as np
 
 """
 Harris Corner Detector

data_structures/binary_tree/non_recursive_segment_tree.py

@@ -35,7 +35,7 @@
 >>> st.query(0, 2)
 [1, 2, 3]
 """
-from typing import List, Callable, TypeVar
+from typing import Callable, List, TypeVar
 
 T = TypeVar("T")
 

data_structures/binary_tree/segment_tree_other.py

@@ -3,9 +3,8 @@
 allowing queries to be done later in log(N) time
 function takes 2 values and returns a same type value
 """
-
-from queue import Queue
 from collections.abc import Sequence
+from queue import Queue
 
 
 class SegmentTreeNode(object):