push_swap

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 most appropriate solution (out of many) for an optimized data sorting.

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
libft		libft
Makefile		Makefile
README.md		README.md
bonus_checker.c		bonus_checker.c
checker_Mac		checker_Mac
op_push.c		op_push.c
op_reverse_rotate.c		op_reverse_rotate.c
op_rotate.c		op_rotate.c
op_swap.c		op_swap.c
ps_atob.c		ps_atob.c
ps_btoa.c		ps_btoa.c
ps_main.c		ps_main.c
pushswap.h		pushswap.h
util_error.c		util_error.c
util_list_print.c		util_list_print.c
util_op_optimize.c		util_op_optimize.c
util_op_print.c		util_op_print.c
util_option_detail.c		util_option_detail.c
util_parse.c		util_parse.c
util_parse_opt.c		util_parse_opt.c
util_pivot.c		util_pivot.c
util_small_sort.c		util_small_sort.c
util_small_sort_proc.c		util_small_sort_proc.c
util_small_sort_rra.c		util_small_sort_rra.c
util_small_sort_rra_proc.c		util_small_sort_rra_proc.c
util_sort.c		util_sort.c

Provide feedback