Florian/1ereNSI
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

edit

Browse Source
This commit is contained in:
Florian Mathieu
2022-03-24 08:26:14 +01:00
parent 9f8f4583b7
commit 76c5bcbc9d
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
algorithmes/PARCOURS.md
View File

@@ -24,7 +24,7 @@ Si on souhaite savoir si un élément nommé *e* en particulier se trouve dans u
def recherche(tab,e): def recherche(tab,e):
occurrence = False occurrence = False
for i in range (len(tab)): for i in range (len(tab)):
if tab[i] == b: if tab[i] == e:
occurrence = True occurrence = True
return occurrence return occurrence
return occurrence return occurrence