GitHub - eablak/push_swap: It efficiently sorts a stack of integers using a series of predefined operations. The algorithm aims to minimize the number of operations required to sort the stack, achieving an efficient sorting process.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
bigSort		bigSort
libft		libft
.gitignore		.gitignore
Makefile		Makefile
build_struct.c		build_struct.c
checker_Mac		checker_Mac
checker_linux		checker_linux
functions.c		functions.c
functions_utils.c		functions_utils.c
main.c		main.c
push_swap.h		push_swap.h
quartet_quintette.c		quartet_quintette.c
start_sorting.c		start_sorting.c

About

It efficiently sorts a stack of integers using a series of predefined operations. The algorithm aims to minimize the number of operations required to sort the stack, achieving an efficient sorting process.