-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2NumSumForloop.c
More file actions
69 lines (40 loc) · 1.18 KB
/
Copy path2NumSumForloop.c
File metadata and controls
69 lines (40 loc) · 1.18 KB
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
#include <stdio.h>
int * find2SumForLoop(int nums[], int numSize, int target, int result[]){
for (int i = 0 ; i < numSize ; i++){
int firstNum = nums[i];
for (int j = i + 1 ; j < numSize ; j++){
int secondNum = nums[j];
if (firstNum + secondNum == target){
result[0] = firstNum;
result[1] = secondNum;
return result;
}
}
}
return result;
}
int * find2SumBest(int nums[], int numSize, int target, int result[]){
for (int i = 0 ; i < numSize ; i++){
int firstNum = nums[i];
for (int j = i + 1 ; j < numSize ; j++){
int secondNum = nums[j];
if (firstNum + secondNum == target){
result[0] = firstNum;
result[1] = secondNum;
return result;
}
}
}
return result;
}
int main(void) {
int nums[7] = {2, 7, 11, 15, 3, 8, 14};
int numSize = 7;
int target = 14;
int result[2];
//find the numbers using for loop
find2SumForLoop(nums,numSize, target, result);
for (int i = 0 ; i < 2 ; i++){
printf("%d \t", result[i]);
}
}