Y/sort-array-by-parity_BACKUP_1728.linq at master · BigMuzzy/Y · GitHub

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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
<Query Kind="Program" />

<<<<<<< HEAD
void Main()
{
	SortArrayByParity(new int[]{0,2,1,3,5,4,7,6,8}).Dump();
=======
//https://leetcode.com/problems/sort-array-by-parity/

void Main()
{
	SortArrayByParity(new int[] {3,1,2,4}).Dump();
>>>>>>> 8708d84032afdf50e094320033ce00beb4709318
}

int[] SortArrayByParity(int[] A)
{
<<<<<<< HEAD
	int i = 0;

	while (i < A.Length && A[i] % 2 != 0)
	{
		i++;
	}

	swap(A, i, 0);

	i = 1;

	while (i < A.Length && A[i] % 2 == 0)
	{
		i++;
	}

	for (int j = i j < A.Length; j++)
	{
		if (A[j] % 2 != 0)
		{
			swap(A, i, j);
			i++;
		}
	}

	int[] R = new int[i];
	Array.Copy(A, R, i);
	return R;
=======
	FindFirstEven(A);

	int i = FindInitialBorder(A); // first odd elment index

	for(int j = i + 1; j < A.Length; j++)
	{
		if(A[j] % 2 == 0)
		{
			swap(A, i, j);
			i++;
		}
	}

	return A;
}

void FindFirstEven(int[] A)
{
	int i = 0;
	while(i < A.Length && A[i] % 2 != 0)
	{
		i++;
	}
}

int FindInitialBorder(int[] A)
{
	int i = 0;
	while(i < A.Length && A[i] % 2 == 0)
	{
		 i++;
	}

	return i;
>>>>>>> 8708d84032afdf50e094320033ce00beb4709318
}

void swap(int[] A, int i, int j)
{
	int tmp = A[i];
	A[i] = A[j];
	A[j] = tmp;
}