aboutsummaryrefslogtreecommitdiff
path: root/src/checker/check.c
diff options
context:
space:
mode:
authorCharles <sircharlesaze@gmail.com>2020-01-19 14:21:53 +0100
committerCharles <sircharlesaze@gmail.com>2020-01-19 14:21:53 +0100
commit6be6c78c8856b14c19a1958dfa3993cc0ced1b3f (patch)
tree68871b12df49d623dda8cfcbda0da810045608e4 /src/checker/check.c
parent2b4327b7a448228f67a054b4bdaa3f84b9db2164 (diff)
downloadpush_swap-6be6c78c8856b14c19a1958dfa3993cc0ced1b3f.tar.gz
push_swap-6be6c78c8856b14c19a1958dfa3993cc0ced1b3f.tar.bz2
push_swap-6be6c78c8856b14c19a1958dfa3993cc0ced1b3f.zip
Added stack operation visualizer, random stack generator, quick sort of some sort (WIP)
Diffstat (limited to 'src/checker/check.c')
-rw-r--r--src/checker/check.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/checker/check.c b/src/checker/check.c
index 125fdb7..bbe509f 100644
--- a/src/checker/check.c
+++ b/src/checker/check.c
@@ -6,7 +6,7 @@
/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/01/18 10:16:08 by cacharle #+# #+# */
-/* Updated: 2020/01/19 07:11:05 by cacharle ### ########.fr */
+/* Updated: 2020/01/19 09:02:08 by cacharle ### ########.fr */
/* */
/* ************************************************************************** */
@@ -48,8 +48,8 @@ static t_action g_actions[] = {
{"sa", FLAG_ARG_A, {.arg_1 = &stack_swap}},
{"sb", FLAG_ARG_B, {.arg_1 = &stack_swap}},
{"ss", FLAG_ARG_A_B, {.arg_2 = &stack_swap_2}},
- {"pa", FLAG_ARG_A_B, {.arg_2 = &stack_push_to}},
- {"pb", FLAG_ARG_B_A, {.arg_2 = &stack_push_to}},
+ {"pa", FLAG_ARG_B_A, {.arg_2 = &stack_push_to}},
+ {"pb", FLAG_ARG_A_B, {.arg_2 = &stack_push_to}},
{"ra", FLAG_ARG_A, {.arg_1 = &stack_rotate}},
{"rb", FLAG_ARG_B, {.arg_1 = &stack_rotate}},
{"rr", FLAG_ARG_A_B, {.arg_2 = &stack_rotate_2}},
@@ -89,9 +89,9 @@ t_bool stack_sorted(t_stack *stack)
if (stack_length(stack) < 2)
return (TRUE);
- i = -1;
- while (++i < stack->top)
- if (stack->elements[i] > stack->elements[i + 1])
+ i = stack->top + 1;
+ while (--i > 0)
+ if (stack->elements[i] > stack->elements[i - 1])
return (FALSE);
return (TRUE);
}