-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset.c
57 lines (50 loc) · 1.21 KB
/
set.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
#include "set.h"
#include <stdlib.h>
void set_init(Set *set) {
set->size = 0;
}
bool set_add(Set *set, int value) {
if (set->size >= MAX_SET_SIZE) {
return false;
}
if (set_contains(set, value)) {
return false;
}
int i = set->size - 1;
while (i >= 0 && set->elements[i] > value) {
set->elements[i + 1] = set->elements[i];
i--;
}
set->elements[i + 1] = value;
set->size++;
return true;
}
bool set_remove(Set *set, int value) {
for (int i = 0; i < set->size; i++) {
if (set->elements[i] == value) {
for (int j = i; j < set->size - 1; j++) {
set->elements[j] = set->elements[j + 1];
}
set->size--;
return true;
}
}
return false;
}
bool set_contains(const Set *set, int value) {
int left = 0, right = set->size - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (set->elements[mid] == value) {
return true;
} else if (set->elements[mid] < value) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return false;
}
int set_size(const Set *set) {
return set->size;
}