--- /dev/null
+/* ************************************************************************** */
+/* */
+/* ::: :::::::: */
+/* algorithm_quicksort.c :+: :+: :+: */
+/* +:+ +:+ +:+ */
+/* By: agilliar <marvin@42.fr> +#+ +:+ +#+ */
+/* +#+#+#+#+#+ +#+ */
+/* Created: 2025/12/05 19:07:14 by agilliar #+# #+# */
+/* Updated: 2025/12/05 19:15:04 by agilliar ### ########.fr */
+/* */
+/* ************************************************************************** */
+
+#include "pushswap.h"
+
+static void quicksort_sift_n(const t_stacks *stacks, size_t n, t_psval pivot, t_closure cb)
+{
+ size_t a;
+ size_t b;
+
+ a = 0;
+ b = 0;
+ while (a + b < n)
+ {
+ if (clist_get_at(&stacks->a, 0) > pivot)
+ {
+ a++;
+ (cb.func)(cb.data, OP_RA);
+ }
+ else
+ {
+ b++;
+ (cb.func)(cb.data, OP_PB);
+ }
+ }
+
+}
+
+void algoritm_quicksort(const t_stacks *stacks, t_closure cb)
+{
+
+}
/* By: agilliar <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2025/12/02 11:02:44 by agilliar #+# #+# */
-/* Updated: 2025/12/03 16:25:25 by agilliar ### ########.fr */
+/* Updated: 2025/12/05 19:08:52 by agilliar ### ########.fr */
/* */
/* ************************************************************************** */
t_closure ops[11];
} t_ops;
-# define STACKID_A false
-# define STACKID_B true
-
-typedef bool t_stackid;
-
void cheatexit(int errcode);
void *cheatalloc(size_t len);