tester push_swap

tester push_swap is a focused analysis tool that simulates the push_swap problem to validate sorting sequences and measure efficiency. It accepts explicit A and B stacks or generated test cases and returns detailed results suitable for debugging and learning.

Conceptually it models two stacks A and B. The simulator applies the standard operations (sa, sb, ss, pa, pb, ra, rb, rr, rra, rrb, rrr) to move elements between stacks until A is sorted or a limit is reached. It can validate a user-provided sequence or generate test sequences to explore corner cases.

Who benefits: students building intuition about stack-based sorting, educators validating assignments, and developers benchmarking push_swap solvers. The tool's traceable operation sequence and final state enable reproducible testing across environments.

Unique value: strict correctness checks, configurable input ranges, and explicit counts of operations vs. optimal expectations. Core features include input normalization, end-state verification, and a structured, exportable result set including final stacks, operation_count, and stepwise state transitions. Typical use cases include unit testing of sort sequences, regression testing when implementing new ops, and learning for algorithm analysis. It is intended for researchers and practitioners seeking deterministic evaluation of push_swap strategies.