rush/max_search_3.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

#include <unistd.h>
void	max_search_3(int x[4], int left, int right)
{
	if (left - right == 0)
		{
			x[0] = 3;
			x[3] = 3;
		}
	if (left == 2 && right == 3)
		{
			x[0] = 3;
			x[2] = 3;
		}
	if (left == 3 && right == 2)
		{
			x[3] = 3;
			x[1] = 3;
		}
	if

}