fork download
  1. def qs(L):
  2. if len(L) < 2:return L
  3. V = []
  4. P = []
  5. for i in L[1:]:
  6. if comparador(L[0], i):P.append(i)
  7. else:V.append(i)
  8. return qs(V) + [L[0]] + qs(P)
  9.  
  10.  
  11. def comparador(e1, e2):
  12. return e1[1] < e2[1] or e1[1] == e2[1] and e1[0] >= e2[0]
  13.  
  14.  
  15. def adjunto(letras, edades):
  16. d = []
  17. for i in range(len(letras)):
  18. d.append((letras[i], edades[i]))
  19. datos = qs(d) # No se pasa ningún comparador
  20. L = []
  21. E = []
  22. for dato in datos:
  23. L.append(dato[0])
  24. E.append(dato[1])
  25. return L, E
  26.  
  27. letras,elementos=["A","B","C","D"],[21,37,17,21]
  28. print(adjunto(letras,elementos))
  29.  
  30. """
  31. def qs(L):
  32. if len(L) < 2:return L
  33. V = []
  34. P = []
  35. for i in L[1:]:
  36. if L[0][1] < L[i][1] or (L[0][1] == L[i][1] and L[0][0] >= L[i][0]): P.append(L[i])
  37. else: V.append(L[i])
  38. return qs(V) + [L[0]] + qs(P)
  39. """
  40.  
Success #stdin #stdout 0.04s 9668KB
stdin
Standard input is empty
stdout
(['C', 'D', 'A', 'B'], [17, 21, 21, 37])