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

special sort for 5 ok

Browse Source
This commit is contained in:
hugogogo
2021-09-27 02:13:21 +02:00
parent bb2a08833a
commit 6a93eda973
15 changed files with 114 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
includes/push_swap.h
View File

@@ -14,9 +14,9 @@ typedef struct s_stack
} t_stack;
/*
** luke's algo
** algo_bubble_sort.c // sort_luke.c
*/
int bubble_sort(t_stack **a, t_stack **b, t_list *solution);
int luke_bubble_sort(t_stack **a, t_stack **b, t_list *solution);
/*
** pushswap.c
@@ -35,9 +35,8 @@ void ps_error(int i);
void ps_stop(t_stack *stack, t_list *lst, int i);
/*
** algo.c
** algo.c // sort.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);
@@ -46,7 +45,18 @@ 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);
/*
** spcecial_sorts_3_5.c
** sort_recursif.c
*/
/*
** sort_utils.c
*/
int find_biggest(t_stack *list, int size);
int find_smallest(t_stack *list, int size);
int sublist_size(t_stack *list);
/*
** spcecial_sorts_3_5.c // sort_specials_3_5.c
*/
void special_sort_3(t_stack **a, t_list *solution);
void special_sort_5(t_stack **a, t_stack **b, t_list *solution);
@@ -54,11 +64,10 @@ void special_sort_5(t_stack **a, t_stack **b, t_list *solution);
/*
** minisort.c
*/
int find_biggest(t_stack *list, int size);
void minisort(t_stack **list, t_list *solution);
/*
** minisort_by_rank.c
** minisort_by_rank.c // minisort_rank.c
*/
int find_rank(t_stack *list, int nbr, int i);
int order_is(t_stack *list, int nbr);
@@ -69,11 +78,11 @@ void sort_2(t_stack **a, t_list *solution);
void mini_sort(t_stack **a, t_list *solution);
/*
** minisort_2ways_bubble_sort.c
** minisort_2ways_bubble_sort.c // minisort_bubble.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);
int find_smallest_bubble(t_stack *list);
void bubble_sort(t_stack **a, t_stack **b, t_list *solution);
/*
** print.c