-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.c
75 lines (68 loc) · 1.69 KB
/
utils.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* utils.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: eelasam <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/04/04 18:04:56 by eelasam #+# #+# */
/* Updated: 2023/04/14 14:34:08 by eelasam ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
// ob die Argumente sortiert sind
int ft_sorted(t_stack *stack)
{
int i;
int j;
int temp;
i = 0;
j = 0;
while (i < stack->a_size - 1)
{
temp = stack->a_stack[i];
if (temp > stack->a_stack[i + 1])
j++;
i++;
}
if (j == 0)
return (-1);
return (1);
}
// Funktion, die das kleinste Element aus einem Stack Elementen zurückgibt
int get_smallest(t_stack *stack)
{
int smallest;
int i;
smallest = stack->a_stack[0];
i = 1;
while (i < stack->a_size)
{
if (stack->a_stack[i] < smallest)
{
smallest = stack->a_stack[i];
}
i++;
}
return (smallest);
}
//word(number) counter
int c_word(char const *s, char c)
{
int i;
int alp;
i = 0;
alp = 0;
while (s && s[i])
{
if (s[i] != c)
{
alp++;
while (s[i] != c && s[i])
i++;
}
else
i++;
}
return (alp);
}