[pre-commit.ci] pre-commit autoupdate (#9013)

* [pre-commit.ci] pre-commit autoupdate

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.0.285 → v0.0.286](https://github.com/astral-sh/ruff-pre-commit/compare/v0.0.285...v0.0.286)
- [github.com/tox-dev/pyproject-fmt: 0.13.1 → 1.1.0](https://github.com/tox-dev/pyproject-fmt/compare/0.13.1...1.1.0)

* updating DIRECTORY.md

* Fis ruff rules PIE808,PLR1714

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>

sorts/counting_sort.py

@@ -49,7 +49,7 @@ def counting_sort(collection):
 
     # place the elements in the output, respecting the original order (stable
     # sort) from end to begin, updating counting_arr
-    for i in reversed(range(0, coll_len)):
+    for i in reversed(range(coll_len)):
         ordered[counting_arr[collection[i] - coll_min] - 1] = collection[i]
         counting_arr[collection[i] - coll_min] -= 1
 

sorts/cycle_sort.py

@@ -19,7 +19,7 @@ def cycle_sort(array: list) -> list:
     []
     """
     array_len = len(array)
-    for cycle_start in range(0, array_len - 1):
+    for cycle_start in range(array_len - 1):
         item = array[cycle_start]
 
         pos = cycle_start

sorts/double_sort.py

@@ -16,9 +16,9 @@ def double_sort(lst):
     """
     no_of_elements = len(lst)
     for _ in range(
-        0, int(((no_of_elements - 1) / 2) + 1)
+        int(((no_of_elements - 1) / 2) + 1)
     ):  # we don't need to traverse to end of list as
-        for j in range(0, no_of_elements - 1):
+        for j in range(no_of_elements - 1):
             if (
                 lst[j + 1] < lst[j]
             ):  # applying bubble sort algorithm from left to right (or forwards)

sorts/odd_even_transposition_parallel.py

@@ -33,7 +33,7 @@ def oe_process(position, value, l_send, r_send, lr_cv, rr_cv, result_pipe):
     # we perform n swaps since after n swaps we know we are sorted
     # we *could* stop early if we are sorted already, but it takes as long to
     # find out we are sorted as it does to sort the list with this algorithm
-    for i in range(0, 10):
+    for i in range(10):
         if (i + position) % 2 == 0 and r_send is not None:
             # send your value to your right neighbor
             process_lock.acquire()
@@ -123,7 +123,7 @@ def odd_even_transposition(arr):
         p.start()
 
     # wait for the processes to end and write their values to the list
-    for p in range(0, len(result_pipe)):
+    for p in range(len(result_pipe)):
         arr[p] = result_pipe[p][0].recv()
         process_array_[p].join()
     return arr