fork download
  1. def quick_sort(inp_arr):
  2. if len(inp_arr) <= 1:
  3. return inp_arr
  4. else:
  5. pivot = inp_arr[0]
  6. left = [x for x in inp_arr[1:] if x < pivot] #all x < pivot go into left
  7. right = [x for x in inp_arr[1:] if x >= pivot] # all x >= pivot go into right
  8. return quick_sort(left) + [pivot] + quick_sort(right)
  9.  
  10. input_arr = [6,5,3,5,12]
  11. print(quick_sort(input_arr))
Success #stdin #stdout 0.03s 9440KB
stdin
Standard input is empty
stdout
[3, 5, 5, 6, 12]