OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2023-10-05 15:01:10 +00:00
parent 1b83b6e4d5
commit 18c9a3388b
1 changed files with 5 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
divide_and_conquer/minimum_element_of_array.py
View File

@ -16,9 +16,7 @@ import random
from typing import Any
def partition(array: list,
starting_index: int,
ending_index: int) -> int:
def partition(array: list, starting_index: int, ending_index: int) -> int:
"""
Partition the array.
Args:
@ -45,9 +43,7 @@ def partition(array: list,
return i + 1
def randomized_partition(array: list,
starting_index: int,
ending_index: int) -> int:
def randomized_partition(array: list, starting_index: int, ending_index: int) -> int:
"""
Randomized partition of the array.
Args:
@ -71,10 +67,9 @@ def randomized_partition(array: list,
return partition(array, starting_index, ending_index)
def selection_sort(array: list,
starting_index: int,
ending_index: int,
smallest_element: int) -> list | None | Any:
def selection_sort(
array: list, starting_index: int, ending_index: int, smallest_element: int
) -> list | None | Any:
"""
Returns a list of sorted array elements using selection sort.
Args: