This project involves sorting a stack of integers in ascending order using specific operations on two stacks named a and b.
Stack a: Contains a random amount of negative and/or positive numbers without duplicates. Stack b: Initially empty.
sa: Swap the first 2 elements of stack a.
sb: Swap the first 2 elements of stack b.
ss: sa and sb simultaneously.
pa: Push the top element of stack b onto stack a.
pb: Push the top element of stack a onto stack b.
ra: Rotate up all elements of stack a by 1.
rb: Rotate up all elements of stack b by 1.
rr: ra and rb simultaneously.
rra: Reverse rotate down all elements of stack a by 1.
rrb: Reverse rotate down all elements of stack b by 1.
rrr: rra and rrb simultaneously.
Program Name: push_swap
Arguments: A list of integers representing stack a, with the first argument at the top of the stack. Output: Display the smallest list of instructions to sort stack a, each instruction separated by a newline.
Project Requirements: Makefile: Compile source files without relinking.
Source files: *.h and *.c files.
Makefile commands: all, clean, fclean, re.
External functions allowed: read, write, malloc, free, exit.
Custom ft_printf function or equivalent.
Libft usage authorized.
Global variables are forbidden.
Program must handle errors, including non-integer arguments, integers exceeding limits, and duplicates. If no parameters are specified, the program should not output anything. Output "Error" followed by a newline for encountered errors. Ensure the sorted stack is displayed properly; otherwise, the grade will be 0.
The program must produce the smallest number of operations to sort the stack. The effectiveness of the sorting algorithm will be evaluated based on the number of operations and the correctness of the sorting. Utilize the provided checker_OS program for evaluation.