From 18c9a3388bc1635627d041da0d08ee30ec5ed53c Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Thu, 5 Oct 2023 15:01:10 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 divide_and_conquer/minimum_element_of_array.py | 15 +++++----------
 1 file changed, 5 insertions(+), 10 deletions(-)

diff --git a/divide_and_conquer/minimum_element_of_array.py b/divide_and_conquer/minimum_element_of_array.py
index d9a32ec80..98d4c30b7 100644
--- a/divide_and_conquer/minimum_element_of_array.py
+++ b/divide_and_conquer/minimum_element_of_array.py
@@ -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: