Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #Divide una lista hasta que obtiene solo un elemento y envía ese valor a "merge"
- def mergesort(lst):
- if len(lst) > 1:
- ind = len(lst)//2
- mitad_izq = lst[:ind]
- mitad_der = lst[ind:]
- return merge(mergesort(mitad_izq),mergesort(mitad_der))
- else:
- return lst
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement