1 Commits
Author SHA1 Message Date
Raffaele Griecopre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>Christian Clauss
0317a96f18 Add the algorithm to search the minimum element of an array using the… (#9688)
* Add the algorithm to search the minimum element of an array using the divide-and-conquer algorithm for selection sort

* Update minimum_element_of_array.py

Resolved Ruff warning

* Update minimum_element_of_array.py

Add type hint for every function

* Update minimum_element_of_array.py

Resolve Ruff error: Error: divide_and_conquer/minimum_element_of_array.py:13:1: I001 Import block is un-sorted or un-formatted

* Update minimum_element_of_array.py

Resolve Ruff errors

* Update minimum_element_of_array.py

* Update minimum_element_of_array.py

Update name of variables

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_element_of_array.py

Update line lenght

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fix comments and documentation in minimum_element_of_array.py

Corrected minor grammatical errors and improved clarity in comments.

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Refactor selection_sort return type

Updated the return type of selection_sort function to simplify it.

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
2026-09-21 15:07:24 +02:00