ayan-b / Quick-Sort

Quick Sort code
0 stars 14 forks source link

Rename quickSort.py to quickSort_2.py #5

Closed ghost closed 6 years ago

ghost commented 6 years ago

Was getting an error for some reason. Seems to run fine as this

def quicksort(x): if len(x) == 1 or len(x) == 0: return x else: pivot = x[0] i = 0 for j in range(len(x)-1): if x[j+1] < pivot: x[j+1],x[i+1] = x[i+1], x[j+1] i += 1 x[0],x[i] = x[i],x[0] first_part = quicksort(x[:i]) second_part = quicksort(x[i+1:]) first_part.append(x[i]) return first_part + second_part

alist = [54,26,93,17,77,31,44,55,20] quicksort(alist) print(alist)