-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcpp-data-structures-array-pair-with-sum.cpp
83 lines (58 loc) · 1.35 KB
/
cpp-data-structures-array-pair-with-sum.cpp
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
#include <iostream>
using namespace std;
struct Array {
int A[15];
int length = 0;
int size;
};
int PairSum(Array arr, int sum) {
int i, j;
cout << "Searching the array for your sum.... " << endl;
for (i = 0; i < arr.length - 1; i++) {
for (j = i + 1; j < arr.length; j++)
{
if (arr.A[i] + arr.A[j] == sum)
cout << arr.A[i] << " + " << arr.A[j] << " = " << sum << endl;
}
}
return 0;
}
int HashPairSum(Array arr, int sum) {
int i;
int h[20]; // hash table
cout << "Searching the array for your sum using a Hash Table.... " << endl;
for (i = 0; i < arr.length - 1; i++) {
h[i] = 0;
if (h[sum-arr.A[i]] != 0 && sum-arr.A[i] > 0){
cout << arr.A[i] << " + " << sum-arr.A[i] << " = " << sum << endl;
}
h[arr.A[i]]++;
}
return 0;
}
int SortedSum(Array arr, int sum) { // searching a sorted list with i at 0 and j at array length - 1
int i = 0;
int j = arr.length - 1;
cout << "Searching the array for your sum.... " << endl;
while (i < j)
{
if (arr.A[i] + arr.A[j] == sum)
{
cout << arr.A[i] << " + " << arr.A[j] << " = " << sum << endl;
i++;
j--;
}
else if (arr.A[i] + arr.A[j] < sum)
i++;
else
j--;
}
return 0;
}
int main() {
Array arr1 = { {8, 1, 3, 4, 6, 9, 8, 11, 12, 13, 15, 17}, 12 };
PairSum(arr1, 7);
HashPairSum(arr1, 4);
SortedSum(arr1, 23);
return 0;
}