GitHub - Redalamtaoui/ft_push_swap: This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
utils		utils
Makefile		Makefile
cheaker.c		cheaker.c
ft_initial_and_free.c		ft_initial_and_free.c
ft_p.c		ft_p.c
ft_r.c		ft_r.c
ft_rr.c		ft_rr.c
ft_s.c		ft_s.c
ft_sort_3_5.c		ft_sort_3_5.c
ft_sort_list.c		ft_sort_list.c
ft_sort_list2.c		ft_sort_list2.c
libft.h		libft.h
parsing.c		parsing.c
push_swap.c		push_swap.c

About

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.