Quicksort

Several implementations of quicksort in multiple languages. Inspired by hugopeixoto's mergesort project.

Rules

1. Unless the language does not provide a standard IO library or there is no reasonable way to pass input to the program, programs should read the array to sort from stdin and output it sorted to stdout:
2. Valid inputs are composed by two lines. The first contains a single integer, the number N of elements in the array. The second contains N integers separated by single spaces, the elements of the array to sort;
3. The program should output a single line containing the N integers of the input array sorted and separated by single spaces, ending with a single newline;
4. If possible, programs should not define a maximum size for the input apriori. They should be able to handle any array of reasonable size, which means they should allocate the necessary memory dynamically;
5. Programs should be implemented using each language's data structures and idioms;
6. There is no problem if the idiomatic way to implement quicksort in a language comes with a performance hit (for example, by not sorting in-place), but the implementation must not have an expected running time worse than O(n log n).
7. No libraries other than the ones provided with the programming language distribution can be used.

Testing

The commands to compile and run each implementation are in the test script. If you have the appropriate tools on your system to compile and/or run a solution, you can run a set of tests against a specific implementation using ./test <folder_name> or run all implementations using ./test all.

If you have Docker installed, you can also test implementations using ./docker_test (<folder_name>|all).