2022-2023/1NSI/09_Recherche_par_dichotomie_et_complexite/algos/1B_max.py
Bertrand Benjamin 369c4fa962
All checks were successful
continuous-integration/drone/push Build is passing
Feat(NSI): cours sur la complexité
2023-03-15 09:00:49 +01:00

7 lines
152 B
Python

def maximum(liste):
candidat = liste[0]
for element in liste:
if element > candidat:
candidat = element
return candidat