Sort linked list code#

Next, we have used a display function here to display the value of all the nodes. Similarly, outside the while loop, the current node is also assigned by the new value. Outside the if-statement, the index node is also incremented with the new value of an index. And at the end, the empty index node is assigned by the data present in the temp variable.

This node will be assigned the value of index data. First, the current node’s data is transferred to temp, and then the current node is now empty. The temp variable will play an important role here in data swapping. Here we will use an if-statement to check if the data in the current node is greater than the data inside the index’s node, then the data between them is swapped. Inside that while loop, another while loop is used, and this will also last until the current node is not null. The index pointer will point to the next part of the current node. Else we will apply logic here that will follow a while loop. Here we will apply a check to identify if the head pointer is at the NULL position then return to the main program. Further usage will be in the program later. Another pointer type variable will be used here and then declared as NULL. As the sort type is not mentioned here, by default, the list will be sorted in ascending order.Ĭoming back towards the example, another current pointer points to the head, as we declared above. So we have added a single node that acts as a temp node to store data in it temporarily.Īfter adding the new node, we will use a function to sort/ arrange the list. First, we will assign data in the first node.įor further addition, the same process continues, but we need to sort the linked list. Now we will assign data, and data can be any random value. ‘head’ second, and third is assigned with the new node. After doing this, all three nodes are allocated in a heap. All three-pointers of these nodes are empty, so they are declared as NULL initially. Three nodes are created inside the main program, with the top first node declared as the ‘head’ node. We have created a class in which its public portion, a data variable of integer type, is created with a pointer type variable ‘next’ that will store the address of the node.

Sort linked list code#

This is a simple C++ code of linked list creation. In C++, we use a structure to represent a node. Its value is Null in the case of an empty array.

The first node of the linked list is called ahead. The advantage of the linked list of an array is that it has a dynamic size. This pointer is used to store the memory address of the node element adjacent to it in the linked list. One includes the data, and the second part consists of the pointer. The items inside the linked list are connected by using pointers. A linked list is a sort of data structure.