fork(4) download
copy 
  1. ar = []
  2.  
  3. def quick(l, r):
  4. 	if (r-l) <= 1:
  5. 		return
  6.  
  7. 	pivot = ar[l]
  8. 	i = l+1
  9. 	for j in range(l+1,r):
  10. 		if ar[j] < pivot:
  11. 			ar[i],ar[j] = ar[j],ar[i]
  12. 			i+=1
  13.  
  14. 	ar[i-1],ar[l] = ar[l],ar[i-1]
  15. 	# print i,j
  16. 	quick(l,i)
  17. 	quick(i,r)
  18.  
  19.  
  20. def qSort():
  21. 	l = 0
  22. 	r = len(ar)
  23. 	quick(l,r)
  24.  
  25. ar = [1, 13, 10, 7, 3]
  26.  
  27. qSort()
  28. print ar
Success #stdin #stdout 0.01s 9016KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
[1, 3, 7, 10, 13]
https://ideone.com/eba7CB
language:
Python (cpython 2.7.16)
created:
7 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!