da7e/42-Push_Swap
1
0
Fork 0
mirror of https://github.com/DavidGailleton/42-Push_Swap.git synced 2026-01-27 00:41:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix bench write size

Browse Source
This commit is contained in:
David GAILLETON
2026-01-14 12:04:51 +01:00
parent 6b5347c997
commit 2c805c9506
2 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
flags/bench.c
View File

@@ -19,7 +19,8 @@ static void print_disorder(t_stacks *stacks)
int nbr;
char *str;
nbr = (int) stacks->disorder * 10000;
stacks->disorder *= 10000;
nbr = (int) stacks->disorder;
str = ft_itoa(nbr);
if (!str)
exit (EXIT_FAILURE);
@@ -41,11 +42,11 @@ static void print_algo(t_stacks *stacks)
secure_write(2, "[bench] algo: ", 14);
if (stacks->algo == 0)
{
secure_write(2, "Adaptative", 10);
secure_write(2, "Adaptive", 8);
if (stacks->disorder < 0.2)
secure_write(2, " / O(n2n)\n", 10);
else if (stacks->disorder >= 0.5)
secure_write(2, " / O(n√n)\n", 10);
secure_write(2, " / O(n√n)\n", 12);
else
secure_write(2, " / O(nlogn)\n", 12);
}
@@ -54,7 +55,7 @@ static void print_algo(t_stacks *stacks)
else if (stacks->algo == 2)
secure_write(2, "Medium / O(nlogn)\n", 18);
else if (stacks->algo == 3)
secure_write(2, "Complex / O(n√n)\n", 17);
secure_write(2, "Complex / O(n√n)\n", 19);
}
static void print_total_ops(t_stacks *stacks)