Skip to content
Snippets Groups Projects
Select Git revision
  • 9289a0f8e45ce3ace63c1b750608cd15a6a1b790
  • master default protected
2 results

tri_rapide.py

  • tri_rapide.py 286 B
    def quicksort(t):
        if t == []:
            return []
        else:
            pivot = t[0]
        t1 = []
        t2 = []
        for x in t[1:]:
            if x<pivot:
                t1.append(x)
            else:
                t2.append(x)
            return quicksort(t1) + [pivot] + quicksort(t2)
    
    quicksort([1,4, 5])