42pde-bakk/push_swap
Summary: This project will make you sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed you’ll have to manipulate various types of algorithms and choose the one (of many) most appropriate solution for an optimized data sorting.
C
Issues
- 0
- 0
Fix 'subprocess call with shell=True identified, security issue.' issue in tester.py
#20 opened by pde-bakk - 0
Fix 'Expression "print(f'KO on input "{test_input}"') and quit()" is assigned to nothing' issue in tester.py
#21 opened by pde-bakk - 1
checker without parameters
#12 opened by pde-bakk - 1
Submodule refs corrupted
#14 opened by pde-bakk - 0
Perhaps too many instructions
#7 opened by pde-bakk - 1
Swap doesn't update stack->bottom
#6 opened by pde-bakk