Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def quicksort(liste):
- unten=[]
- mitte=sum(liste)/len(liste)
- oben=[]
- a = False
- for element in liste:
- if element != liste[0]:
- a=True
- if len(liste)>1 and a == True:
- for element in liste:
- if element >= mitte:
- oben.append(element)
- else:
- unten.append(element)
- return quicksort(unten)+quicksort(oben)
- else:
- return liste
- matrix = [[12, 9, 7, 13],
- [ 6, 11, 15, 8],
- [ 1, 5, 10, 3],
- [ 4, 2, 14, 5]]
- zusammen = []
- matrix2 = []
- for element in matrix:
- for element2 in element:
- zusammen.append(element2)
- zusammen=quicksort(zusammen)
- l= int(len(zusammen)**0.5)
- for i in range(l):
- liste=[]
- matrix2.append(liste)
- for d in range(l):
- matrix2[i].append(zusammen[(i*l)+d])
- print(matrix2)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement