42/42_INT_06_pushwap
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fichiers un peu mieux rangees

Browse Source
This commit is contained in:
hugogogo
2021-09-26 22:29:21 +02:00
parent f07533d101
commit 682be2acbd
11 changed files with 800 additions and 864 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
includes/push_swap.h
View File

@@ -37,8 +37,38 @@ void ps_stop(t_stack *stack, t_list *lst, int i);
/*
** algo.c
*/
int sublist_size(t_stack *list);
int nbr_element_smaller(t_stack *list, int size, int pivot);
int find_pivot(t_stack *list, int size);
int divide_a(t_stack **a, t_stack **b, t_list *solution);
int divide_b(t_stack **a, t_stack **b, t_list *solution);
void send_sublist_to_a(t_stack **a, t_stack **b, t_list *solution);
void hugo_sort(t_stack **a, t_stack **b, t_list *lst);
/*
** minisort.c
*/
int find_biggest(t_stack *list, int size);
void minisort(t_stack **list, t_list *solution);
/*
** minisort_by_rank.c
*/
int find_rank(t_stack *list, int nbr, int i);
int order_is(t_stack *list, int nbr);
void sort_5(t_stack **a, t_list *solution);
void sort_4(t_stack **a, t_list *solution);
void sort_3(t_stack **a, t_list *solution);
void sort_2(t_stack **a, t_list *solution);
void mini_sort(t_stack **a, t_list *solution);
/*
** minisort_2ways_bubble_sort.c
*/
void mark_sublist(t_stack *list);
int find_smallest(t_stack *list);
void sort_big(t_stack **a, t_stack **b, t_list *solution);
/*
** print.c
*/