CareerCup

A working 3-line python code for QuickSort.

def qsort(L):
    if len(L) <= 1: return L
    return qsort( [ lt for lt in L[1:] if lt < L[0] ] )  +  \ 
              [ L[0] ]  +  qsort( [ ge for ge in L[1:] if ge >= L[0] ] )

Now this is the power of Python. Expressiveness!!!

A Bigger version

def qsort1(lst):
	if len(lst) <= 1:
		return lst
	pivot = lst.pop(0)
	greater_eq = qsort1([i for i in lst if i >= pivot])
	lesser = qsort1([i for i in lst if i < pivot])
	return lesser + [pivot] + greater_eq

@LLOLer
I like the first solution. Very smartly done. Quicksort in just 3 lines!, in fact it is just 2 lines baring the def stmt. Thank you for this nice solution.

/* quicksort */
def _partition_( arr, l, r ){
  v = arr[r]
  i = l
  j = r - 1 
  while ( true ){
    while ( arr[i] < v ){ i += 1 }
    while ( arr[j] > v ){ j -= 1 }
    break( i >= j )
    t = arr[i] ; arr[i] = arr[j]; arr[j] = t 
  } 
  t = arr[i] ; arr[i] = arr[r]; arr[r] = t
  i // return  
}

def _qs_(arr, l, r ){
  if ( l >= r ) return  
  // now here
  i = _partition_(arr,l,r)
  _qs_(arr,l,i-1)
  _qs_(arr,i+1,r)
}

def quicksort( arr ){
   _qs_(arr, 0, size(arr) - 1)
}

l = list( [0:13] ) as  { random(100) }
println( l )
quicksort(l)
println(l)