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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <stdbool.h>
#include "assignment2.h"
int add_song(const char* file_name, song s) {
FILE *fptr = fopen("./songs.db","a");
if(fptr == NULL) {
exit(1);
}
if (find_song(file_name, s.title)) {
return 0;
} else {
fwrite(&s, sizeof(s), 1, fptr);
}
fclose(fptr);
return 1;
}
song* find_song(const char* file_name, const char* title) {
FILE *fptr = fopen("./songs.db","r");
song* s = (song*) malloc(sizeof(song));
if(fptr == NULL) {
exit(1);
}
while (true) {
fread(s, sizeof(*s), 1, fptr);
if (feof(fptr)) {
break;
}
if (strcmp(s→title, title) == 0) {
return s;
}
}
fclose(fptr);
return NULL;
}
unsigned long fib3(unsigned int n) {
long* arrFib = (long*) malloc( (n+1) * sizeof(long));
if (arrFib == NULL)
return -1;
//set first 3 numbers of array to be used in loop
arrFib[0] = 0;
arrFib[1] = 1;
arrFib[2] = 2;
//iteratively calculates each number
for (int i = 3; i<=n; i++) {
arrFib[i] = arrFib[i-1] + arrFib[i-2] + arrFib[i-3];
}
return arrFib[n];
}
int linear_search_rec_first(int* ar, int length, int number) {
static bool newArray = false;
static int index = 0;
if (newArray) {
index = 0;
newArray = false;
}
//out of bounds
if (index >= length) {
newArray = true;
return -1;
}
printf("index and num: %d %d\n", index, ar[index]);
if (ar[index] == number) {
printf("in\n");
newArray = true;
return index;
}
//increments after each iteration like a for loop
index++;
newArray = false;
return linear_search_rec_first(ar, length, number);
}
int linear_search_rec_last(int* ar, int length, int number) {
length = length-1;
if (length < 0) {
return -1;
}
if (ar[length] == number) {
return length;
}
return linear_search_rec_last(ar, length, number);
}
int count_tokens(const char* str, char delim) {
// implement me
int i = 0;
int numTokens = 0;
while (str[i] != '\0') {
//adds token count for when non-delim char follows delim
if ( str[i] == delim && str[i+1] != '\0' && str[i+1] != delim ) {
numTokens++;
}
i++;
}
return numTokens; //crashes before returning
}
char** get_tokens(const char* str, char delim) {
int numTokens = count_tokens(str, delim);
int currTokenNum = 0;
char** tokens = malloc(numTokens * sizeof(char*));
for (int i = 0; i < numTokens; i++)
tokens[i] = malloc((strlen(str)) * sizeof(char));
for (int str_i = 0; str_i<strlen(str); str_i++) {
if (str[str_i] != delim) {
// char* currTokenPtr = &tokens[currTokenNum];
int tok_i = 0;
while (str[str_i] != delim) {
tokens[currTokenNum][tok_i] = str[str_i];
str_i++;
tok_i++;
}
printf("\nDONE: tokens[%d] = %s\n\n", currTokenNum, tokens[currTokenNum]);
currTokenNum++;
}
}
for (int i = 0; i < numTokens; i++) {
printf("tokens[%d] = %s\n", i, tokens[i]);
}
return tokens;
}
//have placeholder string, use val of j to properly alloc mem for string
|