fork download
copy 
  1. from random import randrange 
  2.  
  3. def qsort(list):
  4.     if list == []: 
  5.         return []
  6.     else:
  7.         pivot = list[0]
  8.         lesser = qsort([x for x in list[1:] if x < pivot])
  9.         greater = qsort([x for x in list[1:] if x >= pivot])
  10.         return lesser + [pivot] + greater
  11.  
  12. def qsortline(list):
  13.     return [] if list==[]  else qsortline([x for x in list[1:] if x < list[0]]) + [list[0]] + qsortline([x for x in list[1:] if x >= list[0]])
  14.  
  15.  
  16.  
  17. def qsortrand(list):
  18.     if list == []: 
  19.         return []
  20.     else:
  21.         pivot = list.pop(randrange(len(list)))
  22.         lesser = qsortrand([l for l in list if l < pivot])
  23.         greater = qsortrand([l for l in list if l >= pivot])
  24.         return lesser + [pivot] + greater
Success #stdin #stdout 0.03s 5444KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/5mtoj
language:
Python (cpython 2.7.16)
created:
12 years ago
visibility:
public

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!