/Push_Swap

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

Primary LanguageCMIT LicenseMIT

Push Swap

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

Compiling:

First run the make command to compile all necessary files.

$ make

to compile the checker:

$ make bonus

Usage:

To run the program use the following commands, with the needed numbers to sort in the second argument:

The executed operations will be listed as follows:

To run the visualizer add a "-v" as the first argument:

Scores:

  • Sorting 3 number: 2 operations.
  • Sorting 5 numbers: 10 operations.
  • Sorting 100 number: ~600 operation.
  • Sorting 500 number: ~8633 operation.

License

This project is licensed under the MIT License - see the LICENSE file for details.

Author