Practical C Programming

The third and fourth iterations

In the third iteration, we will only need to do the following comparisons:

1. Compare the first and second nodes
2. Compare the second and third nodes

After the third iteration, the third largest value, that is, three, will be set at our desired location, that is, just before node four.

In the fourth, and final, iteration, only the first and second nodes will be compared. The linked list will be sorted in ascending order as follows after the fourth iteration:

Figure 5.28

Let's use GCC to compile the sortlinkedlist.c program as follows:

D:\CBook>gcc sortlinkedlist.c -o sortlinkedlist

If you get no errors or warnings, ...