1. Announcements Remember what we talked on Tuesday in terms of Makefiles and phony targets. Don’t lose points for this! BTW, the.PHONY target can appear anywhere in the file 1

2. Initializing “Strings” char str1[50] = “I am the walrus.” //puts string in str char str2[] = “I am the walrus.” // allocates array of size 17 and stores string same as char str2[17] = “I am the walrus.” char *str3 = “I am the walrus.” //points str3 at the STRING CONSTANT “I am the walrus.” //it is legal to read str3 but not to write to the memory //it points to! 2

3. Reading a line at a time scanf is nice. It parses the input and converts it to integers, floating points, etc. Sometimes (like in assignment 5) we want to read a line at a time from the input. scanf is not so great for that. Fortunately there are functions that do read in a line at a time from the input. Two of them are: getline() fgets() 3

4. getline 4

5. 5

6. The nice thing about getline is that it allocates the memory you need for you. You don’t have to worry about the input being to big to fit in the memory you’ve allocated. The bad thing about getline is that it is a gnu extension and is not available for all systems. (It is available on lectura though) 6

7. fgets or gets 7

8. 8

9. The nice thing about fgets() and gets() is that they’re standard c functions and should be available on all systems. The bad thing is that you have to allocate the memory for them to store the input lines into. What happens if the line is bigger than the space you’ve allocated? 9

10. fgets or gets 10

11. Structs A struct is – an aggregate data structure, i.e., a collection of other data; – can contain components (“fields”) of different types by contrast, arrays contain components of the same type – fields are accessed by name by contrast, array elements are accessed by position Unlike Java classes, a struct can only contain data, not code. 11

12. Declaring structs A node for a linked list of integers: struct node { int val; struct node *next; } 12 optional “structure tag” – used to refer to the structure struct node val next

13. Accessing structure fields Given – a struct s containing a field f to access f, we write s.f Example: struct foo { int count, bar[10]; } x, y; x.count = y.bar[3]; Given – a pointer p to a struct s containing a field f to access f we write p->f // eqvt. to: (*p).f Example: struct foo { int count, bar[10]; } *p, *q; p->count = q->bar[3]; 13 declares x, y to be variables of type “struct foo”

14. Example: sorting a linked list of strings 14 struct s str next points to a string points to another list node declares list_hd as “pointer to something of type struct s”

15. Example: sorting a linked list of strings 15 allocate memory for a list node amount allocated = size of the struct (not the pointer to the struct)

16. Example: sorting a linked list of strings 16 fill in the fields of the newly allocated struct add it to the head of the linked list tmpnode, buf will get deallocated does this cause any problems?

17. Example: sorting a linked list of strings 17 traverse the list compare strings by lexicographic ordering idiomatic C: “iterate as long as ptr  NULL

18. Example: sorting a linked list of strings 18 input strings sorted output