GitHub - lavendelchen/push_swap: building my own sorting algorithm to sort a variable amount of numbers with the least amounts of comparisons!

lavendelchen / push_swap Public

building my own sorting algorithm to sort a variable amount of numbers with the least amounts of comparisons!

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 36 Commits
libft		libft
list_handlers		list_handlers
operations		operations
utils		utils
.gitignore		.gitignore
Makefile		Makefile
calculate_seperate_rotations.c		calculate_seperate_rotations.c
find_shortest_combination.c		find_shortest_combination.c
first_algorithms.c		first_algorithms.c
init_l_i_s.c		init_l_i_s.c
init_three_sort.c		init_three_sort.c
logical_algorithm.c		logical_algorithm.c
push_all_to_a_efficiently.c		push_all_to_a_efficiently.c
push_swap.c		push_swap.c
push_swap.h		push_swap.h
set_sort_to_combination.c		set_sort_to_combination.c