Classic quicksort algorithm
def quicksort ( l , r ) : NEW_LINE INDENT if ( l < r ) : NEW_LINE INDENT mid = partition ( l , r ) NEW_LINE quicksort ( l , mid - 1 ) NEW_LINE quicksort ( mid + 1 , r ) NEW_LINE DEDENT DEDENT