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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// NOTE FROM COURSE STAFF MEETING WITH TAS
// "Old" way
void print_list_OLD_WAY(Node* head) {
Node* curr = head
while(curr != NULL) {
log_int(curr -> value);
curr = curr -> next;
}
}
// "New" way
void print_list(Node* head) {
for(Node* curr = head; curr != NULL; curr = curr -> next) {
log_int(curr -> value);
}
}
int main(int argc, char* argv[]) {
for(int i = 0; i < 5; i++) {
printf("%d\n", i + 1);
}
int i = 0; // INIT
while(i < 5) { // while(CONDITION)
printf("%d\n", i + 1);
i++; // INCREMENT
}
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2022 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.