blob: 2eda66fbc80dcc800024eac0d1aa3430257d5846 (
plain)
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
// Using the heap exercise
char buffer[1000];
int string_legnth = 0;
int *arr = NULL;
int tmp_arr_value = 0;
size_t size_of_arr = 0;
int final_sum_result = 0;
int largest_elemnt = 0;
int input;
int found = 0;
arr = malloc(sizeof(int));
printf("Get me bunch of numbers to sum it up all together (Enter q to see "
"result) [You can also search for a value you entered after seeing "
"the result (also press q to exit completely)]\n");
while (scanf("%s", buffer) == 1) {
if (buffer[0] == 'q') {
break;
}
tmp_arr_value = 0;
// convert ASCII to intgers
for (int i = 0; buffer[i] != '\0'; i++) {
int tmp = buffer[i];
tmp = tmp - '0';
tmp_arr_value = tmp_arr_value * 10 + tmp;
}
arr[size_of_arr] = tmp_arr_value;
// reallocate for a new growing arr
int *tmp = realloc(arr, (size_of_arr + 1) * sizeof(int));
if (!tmp) {
return 1;
}
arr = tmp;
size_of_arr++;
}
for (int i = 0; arr[i] != '\0'; i++) {
final_sum_result += arr[i];
}
// finding the largest element in an array
for (int i = 0; arr[i] != '\0'; i++) {
if (largest_elemnt < arr[i]) {
largest_elemnt = arr[i];
}
}
// reverse the array
// finding the length of the array
int arr_len = 0;
for (int i = 0; arr[i] != '\0'; i++) {
arr_len++;
}
printf("THE RESULT IS [%d]\n", final_sum_result);
printf("The largest value Entered was [%d]\n", largest_elemnt);
// reversing the array
int *rev_arr = malloc(sizeof(*rev_arr) * arr_len);
for (int i = 0; arr[i] != '\0'; i++) {
rev_arr[i] = arr[arr_len - 1];
arr_len--;
}
// printing the array in reverse
printf("The array in reverse is ");
for (int i = 0; rev_arr[i] != '\0'; i++) {
printf("%d ", rev_arr[i]);
}
printf("\n");
while (scanf("%s", buffer) == 1) {
if (buffer[0] == 'q') {
break;
}
tmp_arr_value = 0;
// convert ASCII to intgers
for (int i = 0; buffer[i] != '\0'; i++) {
int tmp = buffer[i];
tmp = tmp - '0';
tmp_arr_value = tmp_arr_value * 10 + tmp;
}
for(int i = 0;arr[i] != '\0';i++) {
if(tmp_arr_value == arr[i]) {
found = tmp_arr_value;
}
}
if(found == 0) {
printf("Value not found\n");
}
else if (found != 0) {
printf("The value is found within the array\n");
found = 0;
}
}
free(arr);
free(rev_arr);
return 0;
}
|
