-
Notifications
You must be signed in to change notification settings - Fork 1
/
doalg.c
94 lines (82 loc) · 1.65 KB
/
doalg.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include "COMPARE.c"
#include <stdio.h>
void swap(int *a, int *b)
{
*a = *a + *b;
*b = *a - *b;
*a = *a - *b;
}
void minHeapify(int minArray[], int size, int i)
{
int l = 2 * i;
int r = 2 * i + 1;
int smallest = i;
if (l < size && COMPARE(minArray[l], minArray[smallest]) == 2)
smallest = l;
if (r < size && COMPARE(minArray[r], minArray[smallest]) == 2)
smallest = r;
if (smallest != i)
{
swap(&minArray[i], &minArray[smallest]);
minHeapify(minArray, size, smallest);
}
}
void buildMinHeap(int a[], int size)
{
int i;
for (i = size / 2; i >= 0; i--)
minHeapify(a, size, i);
}
int binarySearch(int a[], int item, int low, int high)
{
if (high <= low)
return (COMPARE(item, a[low]) == 1) ? (low + 1) : low;
int mid = (low + high) / 2;
if (item == a[mid])
return mid + 1;
if (COMPARE(item, a[mid]) == 1)
return binarySearch(a, item, mid + 1, high);
return binarySearch(a, item, low, mid - 1);
}
void insertionSort(int a[], int n)
{
int i, loc, j, k, selected;
for (i = 1; i < n; ++i)
{
j = i - 1;
selected = a[i];
loc = binarySearch(a, selected, 0, j);
while (j >= loc)
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = selected;
}
}
int doalg(int n, int k, int Best[])
{
int i, j;
int minArray[k];
for (i = 1, j = 0; i <= k; i++, j++)
{
minArray[j] = i;
}
buildMinHeap(minArray, k);
for (i = k + 1; i <= n; i++)
{
if (COMPARE(i, minArray[0]) == 1)
{
minArray[0] = i;
minHeapify(minArray, k, 0);
}
}
insertionSort(minArray, k);
j = k - 1;
for (i = 0; i < k; i++)
{
Best[i] = minArray[j];
j--;
}
return 1;
}