only the description of project, code in private repo
A sorting program, receiving integers in the standard entry and prints out a series of operations in order to sort the numbers. Optimization is the first priority, with the limitation of having only certain operations available.
For this project, i created my own sorting algorithm, a combination of sorting, fusion and quick in recursivity. The mix-algo was optimized for the 100 arguments sorting but not for the 500. So for the advanced sorting, i implemented another algo, that sorts by chunks.
$ git clone https://github.com/vveewwee/push_swap/
$ make
$ ./push_swap <parameters>