special sort for 5 ok
This commit is contained in:
@@ -1,28 +1,6 @@
|
||||
#include "push_swap.h"
|
||||
|
||||
/*
|
||||
int find_biggest(t_stack *list, int size)
|
||||
{
|
||||
int biggest;
|
||||
int position;
|
||||
int i;
|
||||
|
||||
biggest = list->n;
|
||||
position = 1;
|
||||
i = 1;
|
||||
while (list && --size)
|
||||
{
|
||||
i++;
|
||||
list = list->next;
|
||||
if (biggest < list->n)
|
||||
{
|
||||
position = i;
|
||||
biggest = list->n;
|
||||
}
|
||||
}
|
||||
return (position);
|
||||
}
|
||||
|
||||
void push_biggest(t_stack **list, t_list *solution, int size, int big)
|
||||
{
|
||||
t_stack *head;
|
||||
|
||||
Reference in New Issue
Block a user