-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsegregate.dart
57 lines (48 loc) · 1.15 KB
/
segregate.dart
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
void main(List<String> args) {
List<int> array = [9, -5, 12, 10, -9, -2];
print(array);
segregate(array, 0, array.length - 1);
print(array);
}
void segregate(List<int> array, int start, int end) {
if (end <= start) return;
int mid = (end + start) ~/ 2;
segregate(array, start, mid);
segregate(array, mid + 1, end);
merge(array, start, mid, end);
}
void merge(List<int> array, int start, int mid, int end) {
int i, j, k;
int leftLength = mid - start + 1;
int rightLength = end - mid;
List<int> leftArray = List.filled(leftLength, 0);
List<int> rightArray = List.filled(rightLength, 0);
for (int i = 0; i < leftLength; i++) {
leftArray[i] = array[start + i];
}
for (int j = 0; j < rightLength; j++) {
rightArray[j] = array[mid + 1 + j];
}
i = j = 0;
k = start;
while (i < leftLength && leftArray[i] <= 0) {
array[k] = leftArray[i];
i++;
k++;
}
while (j < rightLength && rightArray[j] <= 0) {
array[k] = rightArray[j];
j++;
k++;
}
while (i < leftLength) {
array[k] = leftArray[i];
i++;
k++;
}
while (j < rightLength) {
array[k] = rightArray[j];
j++;
k++;
}
}