Add inefficient quicksort? algorithm

This algorithm is based on quicksort but probably not really in its
spirit. It is extremely inefficient but could maybe fixed with some
post-optimization.

1 files changed, 6 insertions, 6 deletions

diff --git a/main.c b/main.c
index 803f6eb..076688b 100644
--- a/main.c
+++ b/main.c
@@ -6,7 +6,7 @@
 /*   By: dkaiser <dkaiser@student.42heilbronn.de    +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2024/04/12 17:03:30 by dkaiser           #+#    #+#             */
-/*   Updated: 2024/04/15 17:53:19 by dkaiser          ###   ########.fr       */
+/*   Updated: 2024/04/15 23:41:34 by dkaiser          ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -39,11 +39,11 @@ int	main(int argc, char *argv[])
 	stack_b->size = 0;
 	stack_optimize(stack_a);
 	pscmds = stack_sort(stack_a, stack_b);
-	/* optimize_commands(&pscmds); */
+	optimize_commands(&pscmds);
 	print_commands(pscmds);
-	ft_printf("\nA: ");
-	stack_print(stack_a);
-	ft_printf("B: ");
-	stack_print(stack_b);
+	/* ft_printf("\nA: "); */
+	/* stack_print(stack_a); */
+	/* ft_printf("B: "); */
+	/* stack_print(stack_b); */
 	return (0);
 }