def quick_sort(arr, simulation=False):
iteration = <NUM_LIT:0><EOL>if simulation:<EOL><INDENT>print("<STR_LIT>",iteration,"<STR_LIT::>",*arr)<EOL><DEDENT>arr, _ = quick_sort_recur(arr, <NUM_LIT:0>, len(arr) - <NUM_LIT:1>, iteration, simulation)<EOL>return arr<EOL>
Quick sort
        Complexity: best O(n log(n)) avg O(n log(n)), worst O(N^2)