forked from menault/TD4_DEV51_Qualite_Algo
68 lines
1.3 KiB
Python
68 lines
1.3 KiB
Python
import random
|
|
|
|
|
|
def function_1(tableau1,tableau2):
|
|
presentDansDeuxListes = 0
|
|
for nombre1 in tableau1:
|
|
for nombre2 in tableau2:
|
|
if nombre1 == nombre2:
|
|
presentDansDeuxListes += 1
|
|
break
|
|
return presentDansDeuxListes
|
|
|
|
|
|
def function_2(x):
|
|
valeur = 0
|
|
while x > 0:
|
|
valeur = valeur + x
|
|
x -= 1
|
|
return valeur
|
|
|
|
|
|
def function_3(x):
|
|
valeur = 0
|
|
if x < 0:
|
|
valeur = -x
|
|
if x == 0:
|
|
pass
|
|
if x > 0:
|
|
valeur = x
|
|
return valeur
|
|
|
|
|
|
|
|
|
|
|
|
def algo_tri(tab):
|
|
N=len(tab)
|
|
M=len(tab[0])
|
|
for i in range(len(tab)):
|
|
for j in range(0, len(tab)-i-1):
|
|
if (sum(tab[j]) > sum(tab[j+1])):
|
|
temp = tab[j]
|
|
tab[j] = tab[j+1]
|
|
tab[j+1] = temp
|
|
|
|
for t in tab:
|
|
for i in range(len(t)):
|
|
for j in range(0, len(t)-i-1):
|
|
if (t[j] > t[j+1]):
|
|
temp = t[j]
|
|
t[j] = t[j+1]
|
|
t[j+1] = temp
|
|
|
|
|
|
data = []
|
|
for i in range(10):
|
|
data.append([random.choice(range(10000)) for _ in range(3)])
|
|
|
|
print(data)
|
|
algo_tri(data)
|
|
print(data)
|
|
string = ""
|
|
for i in data:
|
|
string += "["
|
|
string += str(sum(i))
|
|
string += "],"
|
|
print(string)
|