forked from menault/TD4_DEV51_Qualite_Algo
60 lines
1.1 KiB
Markdown
60 lines
1.1 KiB
Markdown
## Exercice 1
|
|
|
|
def function_1(tableau1,tableau2):
|
|
presentDansDeuxListes = 0
|
|
for nombre1 in tableau1:
|
|
for nombre2 in tableau:
|
|
if nombre1 == nombre2:
|
|
presentDansDeuxListes += 1
|
|
break
|
|
return presentDansDeuxListes
|
|
|
|
complexité : O(n*m) ou n la longuer du tableau1 et m la longueur du tableau2
|
|
|
|
def function_2(x):
|
|
valeur = 0
|
|
while x > 0:
|
|
valeur = valeur + x
|
|
x -= 1
|
|
return valeur
|
|
|
|
complexité : O(x)
|
|
|
|
def function_3(x):
|
|
valeur = 0
|
|
if x < 0:
|
|
valeur = -x
|
|
if x == 0:
|
|
pass
|
|
if x > 0:
|
|
valeur = x
|
|
return valeur
|
|
|
|
complexité O(1)
|
|
|
|
## Exercice 2
|
|
|
|
tab = [ [0,3,2], [9,4,5], [4,1,3]]
|
|
|
|
def tri(tableau):
|
|
x = 0
|
|
valueTab = {}
|
|
for subTab in tableau :
|
|
sum = 0
|
|
subTab.sort()
|
|
for value in subTab:
|
|
sum = sum + value
|
|
valueTab[x] = sum
|
|
x = x + 1
|
|
newValueTab = dict(sorted(valueTab.items(), key=lambda item: item[1]))
|
|
newTab = []
|
|
for key in newValueTab:
|
|
newTab.append(tableau[key])
|
|
print(newTab)
|
|
|
|
|
|
|
|
tri(tab)
|
|
|
|
|