Sams Teach Yourself C in 21 Days

32: puts(“Enter 0 for reverse order sort, 1 for alphabetical:” ); 33: scanf(“%d”, &sort_type); 34: 35: sort(lines, number_of ...

Pointers: Beyond the Basics 415 81: } 15 82: } 83: } /* end of sort() */ 84: 85: void print_strings(char *p[], int n) 86: { 87: ...

Bonus Section: Understanding Linked Lists ...................................................... Alinked listis a useful method ...

Pointers: Beyond the Basics 417 15 person—in other words, a pointer to another structure of the same type. This means that each ...

elements can. As we stated earlier, elements in a list are connected with pointers. Much of the work of adding and deleting elem ...

Pointers: Beyond the Basics 419 15 Figure 15.9 illustrates the procedure for adding a new element to an empty list, and Figure 1 ...

Notice that malloc()is used to allocate the memory for the new element. As each new element is added, only the memory needed for ...

Pointers: Beyond the Basics 421 15 Adding an Element to the Middle of the List When you’re working with a linked list, most of t ...

Deleting an Element from the List Deleting an element from a linked list is a simple matter of manipulating pointers. The exact ...

Pointers: Beyond the Basics 423 15 current2= current1->next; } free(current1->next); current1->next = null; if (head == ...

10: char name[20]; 11: struct data *next; 12: }; 13: 14: /* Define typedefs for the structure */ 15: /* and a pointer to it. */ ...

Pointers: Beyond the Basics 425 59: printf(“\n%s”, current->name); 15 60: current = current->next; 61: } 62: 63: printf(“\ ...

Note that the return type from malloc()is typecast to be type LINK (you learn more about typecasts on Day 20). The next task is ...

Pointers: Beyond the Basics 427 17: struct list *next_rec; 15 18: }; 19: 20: /* Typedefs for the structure and pointer. */ 21: t ...

66: LISTPTR new_rec = NULL; /* Holds address of new rec */ 67: LISTPTR tmp_rec = NULL; /* Hold tmp pointer */ 68: LISTPTR prev_r ...

Pointers: Beyond the Basics 429 115: if (new_rec->next_rec != prev_rec->next_rec) 15 116: { 117: printf(“ERROR”); 118: get ...

164: cur_ptr = first; 165: while (cur_ptr != NULL ) 166: { 167: printf(“ %X “, cur_ptr ); 168: printf(“ %2i %c”, counter++, cur_ ...

Pointers: Beyond the Basics 431 15 222490 3 c 222450 222450 4 q 222480 222480 5 z 0 Note Your output will probably show differen ...

The most important (and most complicated!) function in this listing is add_to_list()in lines 56 through 149. Lines 66 through 68 ...

Pointers: Beyond the Basics 433 15 If the tmp_recpointer isn’t NULL, you know that you already have more than two links in your ...