Merge pull request #1433 from cclauss/patch-1

Fix failing tests again

Author: geekcomputers

.github/workflows/lint_python.yml

@@ -1,15 +1,24 @@
 name: lint_python
-on: [push, pull_request]
+on: [pull_request, push]
 jobs:
   lint_python:
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@master
-      - uses: actions/setup-python@master
-      - run: pip install black codespell flake8 isort pytest
+      - uses: actions/checkout@v2
+      - uses: actions/setup-python@v2
+      - run: pip install --upgrade pip wheel
+      - run: pip install bandit black codespell flake8 flake8-2020 flake8-bugbear
+                         flake8-comprehensions isort mypy pytest pyupgrade safety
+      - run: bandit --recursive --skip B101 . || true  # B101 is assert statements
       - run: black --check . || true
-      - run: codespell --quiet-level=2 || true  # --ignore-words-list="" --skip=""
+      - run: codespell || true  # --ignore-words-list="" --skip="*.css,*.js,*.lock"
       - run: flake8 . --count --select=E9,F63,F7,F82 --show-source --statistics
-      - run: isort --recursive . || true
-      - run: pip install -r requirements.txt || true
-      - run: pytest .
+      - run: flake8 . --count --exit-zero --max-complexity=10 --max-line-length=88
+                      --show-source --statistics
+      - run: isort --check-only --profile black . || true
+      - run: pip install -r requirements.txt || pip install --editable . || true
+      - run: mkdir --parents --verbose .mypy_cache
+      - run: mypy --ignore-missing-imports --install-types --non-interactive . || true
+      - run: pytest . || pytest --doctest-modules .
+      - run: shopt -s globstar && pyupgrade --py36-plus **/*.py || true
+      - run: safety check

Binary_search.py

@@ -12,11 +12,11 @@ def binary_search(arr, l, r, x):
         # If element is smaller than mid, then it can only
         # be present in left subarray
         elif arr[mid] > x:
-            return binarySearch(arr, l, mid - 1, x)
+            return binary_search(arr, l, mid - 1, x)
 
         # Else the element can only be present in right subarray
         else:
-            return binarySearch(arr, mid + 1, r, x)
+            return binary_search(arr, mid + 1, r, x)
 
     # If we reach here, then the element was not present 
     return -1

Python Program to Display Fibonacci Sequence Using Recursion

@@ -8,7 +8,7 @@ nterms = 10
 
 # check if the number of terms is valid
 if nterms <= 0:
-   print("Plese enter a positive integer")
+   print("Please enter a positive integer")
 else:
    print("Fibonacci sequence:")
    for i in range(nterms):