abandon optimisations et no more leaks

srcs/minisort.c

@@ -1,5 +1,6 @@
 #include "push_swap.h"
 
+/*
 int	find_biggest(t_stack *list, int size)
 {
 	int	biggest;
@@ -49,6 +50,7 @@ void	minisort(t_stack **list, t_list *solution)
 	(*list)->limit = 1;
 	mark_step(solution, "minisort");
 }
+*/
 
 /*
 t_stack *test;