spectre/cours
1
0
Fork 0
mirror of https://github.com/Fare-spec/cours.git synced 2025-12-09 19:30:40 +00:00
Code Issues Packages Projects Releases Wiki Activity

formatte file

Browse Source
This commit is contained in:
Spectre
2025-04-01 14:28:43 +02:00
parent f2ae2cbc13
commit e03e5458aa
77 changed files with 1231 additions and 945 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
recursivite/exercice_MJoannic/dichotomie/recursif/myself/main.py
View File

@@ -1,7 +1,14 @@
from sort_list import sort_list
from typing import Any
def dichotomie(liste: list[Any], element: Any, start: int = 0, end: int = None, bypass_sorting: bool = False) -> bool:
def dichotomie(
liste: list[Any],
element: Any,
start: int = 0,
end: int = None,
bypass_sorting: bool = False,
) -> bool:
"""Performs a dichotomy search to determine if an element exists in a list or not.
Args:
@@ -33,6 +40,10 @@ def dichotomie(liste: list[Any], element: Any, start: int = 0, end: int = None,
if liste[middle] == element:
return True
elif element < liste[middle]:
return dichotomie(liste, element, start, middle - 1, bypass_sorting=True) # bypass_sorting because it's already done
return dichotomie(
liste, element, start, middle - 1, bypass_sorting=True
) # bypass_sorting because it's already done
else:
return dichotomie(liste, element, middle + 1, end, bypass_sorting=True) # bypass_sorting because it's already done
return dichotomie(
liste, element, middle + 1, end, bypass_sorting=True
) # bypass_sorting because it's already done