Sorting a singly linked list

In this recipe, we will learn how to create a singly linked list comprising integer elements, and then we will learn how to sort this linked list in ascending order. 

A singly linked list consists of several nodes that are connected through pointers. A node of a singly linked list might appear as follows:

Figure 5.16

As you can see, a node of a singly linked list is a structure composed of two parts:

• Data: This can be one or more variables (also called members) of integer, float, string, or any data type. To keep the program simple, we will take data as a single variable of the integer type.
• Pointer: This will point to the structure of the type node. Let's call this pointer next in this program, though it can be under any name.

We will use bubble sort for sorting the linked list. Bubble sort is a sequential sorting...