Problem Question
To implement Linked List and perform searching and sorting on it
Explanation of Problem
In this program we would be implementing a Linked List. Make sure you have a strong understanding of pointers to understand Linked Lists. A linked list is a basic data structure that is used in dynamic memory allocation applications. It comprises of ‘nodes’ which are linked together to form a sequence of nodes called Linked List. The linkage is done using memory addresses of adjacent nodes (next node in singly linked list, and both next & previous node in doubly linked list).
In this program we use a struct to implement the node of our linked list. We will implement addition function to get some data in linked list before we can perform sorting/searching on it. Adding a new node to the list means, creating a new node structure, allocating memory to it and linking it to the list.
Code
#include <iostream>
/**@Title: LinkedList v1.3.cpp*
*@Programming Paradigm: Procedural*
*@Language: C++*
*@Compiler: GNU GCC*
*@IDE: Code::Blocks 13.12*
*@Author: Rogue Coder*
*@URL: http://letsplaycoding.blogspot.com/*
*@Date: 27-10-2014*
*/
struct node
{
int data;
node* next;
};
node* startList;
void addAtLast();
void searchPositions();
void searchHighlight();
void sortList();
void displayList();
int main()
{
int choice;
std::cout << "Welcome to LinkedList v1.3" << std::endl << "Made by Rogue Coder" << std::endl;
do
{
std::cout << std::endl << "1 : Add a Node to the list" <<
std::endl << "2 : Search a Node (Display Positions)" <<
std::endl << "3 : Search a Node (Highlight Nodes)" <<
std::endl << "4 : Sort the Linked List" <<
std::endl << "5 : Display List" <<
std::endl << "6 : Exit" <<
std::endl << "Enter your choice : ";
std::cin>>choice;
switch(choice)
{
case 1:
addAtLast();
break;
case 2:
searchPositions();
break;
case 3:
searchHighlight();
break;
case 4:
sortList();
break;
case 5:
displayList();
break;
case 6:
std::cout<<std::endl<<"Thank you for using LinkedList v1.3"<<std::endl<<"Made by Rogue Coder"
<<std::endl<<"Press any key to exit"<<std::endl;
break;
default:
std::cout<<"\a\aWrong Choice\a\a"<<std::endl;
break;
}
}
while(choice != 6);
std::cin.get();
return 0;
}
void addAtLast()
{
node* newNode = new node;
std::cout<<std::endl<<"Enter data : ";
std::cin>>newNode->data;
if(startList == NULL)
{
startList = newNode;
}
else
{
node* currentNode=startList;
while(currentNode->next != NULL)
{
currentNode=currentNode->next;
}
currentNode->next=newNode;
}
newNode->next=NULL;
}
void searchPositions()
{
if (startList == NULL)
{
std::cout<<std::endl<<"\aList Empty\a";
}
else
{
int elementToFind, foundAt = 1, foundFlag = 0;
node* currentNode = startList;
std::cout << std::endl << "Enter the element you wish to search: ";
std::cin >> elementToFind;
while (currentNode)
{
if(elementToFind == currentNode -> data)
{
std::cout << std::endl << elementToFind << " Found at position: " << foundAt;
foundFlag = 1;
}
currentNode = currentNode -> next;
foundAt++;
}
if (foundFlag != 1)
{
std::cout << std::endl << "Element not found!";
}
}
std::cout << std::endl;
}
void searchHighlight()
{
if (startList == NULL)
{
std::cout<<std::endl<<"\aList Empty\a";
}
else
{
int elementToFind, foundFlag = 0;
node* currentNode = startList;
char separator = 221;
std::cout << std::endl << "Enter the element you wish to search: ";
std::cin >> elementToFind;
std::cout << std::endl;
while (currentNode)
{
if(elementToFind == currentNode -> data)
{
std::cout << separator << currentNode -> data << separator << "->";
foundFlag = 1;
}
else
{
std::cout << currentNode -> data << "->";
}
currentNode = currentNode -> next;
}
if (foundFlag != 1)
{
std::cout << std::endl << "Element not found!";
}
else
{
std::cout << "End of List";
}
}
std::cout << std::endl;
}
void sortList()
{
if(startList == NULL)
{
std::cout<<std::endl<<"\aList Empty\a"<<std::endl;
}
else
{
node *temporaryNode = new node();
node *currentNode = startList;
node *compareMe;
while (currentNode)
{
compareMe = currentNode;
while (compareMe)
{
if(currentNode -> data > compareMe -> data)
{
temporaryNode -> data = currentNode -> data;
currentNode -> data = compareMe -> data;
compareMe -> data = temporaryNode -> data;
}
compareMe = compareMe -> next;
}
currentNode = currentNode -> next;
}
}
}
void displayList()
{
node *currentNode = startList;
if(currentNode == NULL)
{
std::cout<<std::endl<<"\aList Empty\a"<<std::endl;
}
else
{
std::cout<<std::endl;
while(currentNode != NULL)
{
std::cout<<currentNode->data<<"->";
currentNode=currentNode->next;
}
std::cout<<"End of List"<<std::endl;
}
}
Explanation of Code
#include <iostream> -> The compiler calls the Preprocessor to include the IOSTREAM(Standard Input / Output Streams Library) header file into the program, thus letting the use of the Standard Input / Output Streams functions like std::cin and std::cout. As per C++11 specification, including <iostream> automatically includes also <ios>, <streambuf>, <istream>, <ostream> and <iosfwd>.
int main() -> The entry point of the program where the execution starts. This function has to be named main. As per the ANSI specification, the return type has to be int. Since the return type is specified as int in my program, I have to use a return statement at the end of my code. So I use return 0 since zero returned from a function, by convention, implies a correct execution of the program. The return values are used to debug the program.
std::cin (extern istream cin) -> Standard Input Stream, and object of class istream. It is generally used with the extraction operator (>>), though we can use member functions like get (cin.get()), read (cin.read()), etc. for the input. The use of extraction operator is much more popular due to the fact that it aids in getting formatted input.
std::cout (extern ostream cout) -> Standard Output Stream, and object of class ostream. It is generally used with the insertion operator (<<), though we can use member functions like write (cout.write()) for the output. The use of insertions operator is much more popular due to the fact that it aids in giving formatted output.
std::endl (ostream& endl (ostream& os)) -> This is a function which is used to insert a newline character and flush the stream. Because this function is a manipulator, it is designed to be used alone with no arguments in conjunction with the insertion (<<) operations on output streams.
struct node
{
int data;
node* next;
}; ->This is where we create the struct node that is going to be the building block of our linked list. It comprises of an int ‘data’ where the user shall store the data they wish. Please note, you can use as many variables and of as many types in the struct, but be sure you handle them correctly. For simplicity we have used int type in our case. The other variable inside our node is ‘next’, which is a pointer to node. This would be used to build the linkage between the nodes of our linked list. ‘next’ is going to hold the address of the next node in the sequence.
node* startList; -> The global pointer ‘startList’ which we are going to use to point to the first node/root node/ start node of the linked list, we are going to implement in this program.
int choice; -> This variable ‘choice’ will be used for the user’s choice in the menu driven program.
void addAtLast()
{
node* newNode = new node;
std::cout<<std::endl<<"Enter data : ";
std::cin>>newNode->data;
if(startList == NULL)
{ startList = newNode; }
else
{
node* currentNode=startList;
while(currentNode->next != NULL)
{ currentNode=currentNode->next; }
currentNode->next=newNode;
}
newNode->next=NULL;
} -> This function is used to add a new node at the end of our linked list. It asks for user input and the data is stored in the ‘newNode’ which is the pointer to the new node that we are going to add to our list. The first statement of this function means, memory is allocated for a node type variable and a pointer is returned which we capture in the variable ‘newNode’. After the user input the program checks if the list is empty which we come to know if the ‘startList’, i.e., root node of the linked list is initialised as yet or not. If the root node is not yet initialised for our list, we make the ‘startList’ pointer to point to the ‘newNode’ we just created. Else, we traverse through the list. Starting from the root node, we hold the position in a new pointer, ‘currentNode’. Since the last node’s ‘next’ won’t point to any node, thus we use currentNode->next != NULL for that. Till so is the case, we keep on assigning the address of the next node in sequence to the pointer ‘currentNode’. So as and when we encounter the last node in the list, we come out of the loop. The pointer ‘currentNode’ now holds the address to the last node in the list. So we define the ‘next’ for this last node of ours as the newNode we just created. Now the next of newNode is set to NULL, hence the newNode is added at the end of the list.
{
if (startList == NULL)
{
std::cout<<std::endl<<"\aList Empty\a";
}
else
{
int elementToFind, foundAt = 1, foundFlag = 0;
node* currentNode = startList;
std::cout << std::endl << "Enter the element you wish to search: ";
std::cin >> elementToFind;
while (currentNode)
{
if(elementToFind == currentNode -> data)
{
std::cout << std::endl << elementToFind << " Found at position: " << foundAt;
foundFlag = 1;
}
currentNode = currentNode -> next;
foundAt++;
}
if (foundFlag != 1)
{
std::cout << std::endl << "Element not found!";
}
}
std::cout << std::endl;
}
{
if (startList == NULL)
{
std::cout<<std::endl<<"\aList Empty\a";
}
else
{
int elementToFind, foundFlag = 0;
node* currentNode = startList;
char separator = 221;
std::cout << std::endl << "Enter the element you wish to search: ";
std::cin >> elementToFind;
std::cout << std::endl;
while (currentNode)
{
if(elementToFind == currentNode -> data)
{
std::cout << separator << currentNode -> data << separator << "->";
foundFlag = 1;
}
else
{
std::cout << currentNode -> data << "->";
}
currentNode = currentNode -> next;
}
if (foundFlag != 1)
{
std::cout << std::endl << "Element not found!";
}
else
{
std::cout << "End of List";
}
}
std::cout << std::endl;
}
{
if(startList == NULL)
{
std::cout<<std::endl<<"\aList Empty\a"<<std::endl;
}
else
{
node *temporaryNode = new node();
node *currentNode = startList;
node *compareMe;
while (currentNode)
{
compareMe = currentNode;
while (compareMe)
{
if(currentNode -> data > compareMe -> data)
{
temporaryNode -> data = currentNode -> data;
currentNode -> data = compareMe -> data;
compareMe -> data = temporaryNode -> data;
}
compareMe = compareMe -> next;
}
currentNode = currentNode -> next;
}
}
}
Let’s take an example list: ‘3->2->5->1’.
Iteration 1(outer loop): currentNode points at 3, and compareMe starts also at 3. Now, we compare 3 with 3, nothing happens. Then compare me points to ‘2’. Now we exchange 2 and 3. So the list becomes: ‘2->3->5->1’. Now currentNode is pointing at 2, and compareMe at 3. Then compareMe points to 5. No exchange happens. Then compareMe points to ‘1’. Now the exchange happens between ‘2’(currentNode) and ‘1’(compareMe). List becomes: ‘1->3->5->2’.
Iteration 2(outer loop): Now currentNode is pointing at ‘3’. compareMe starts from ‘3’. No exchange happens when compareMe points to ‘3’, or ‘5’. Then when comapreMe points to ‘2’, exchange happens. Thus, currentNode points at ‘2’ and compareMe at ‘3’. Now the list is: ‘1->2->5->3’.
Iteration 3(outer loop): Now currentNode is pointing at ‘5’. So compareMe starts from this ‘5’. When compareMe points at ‘3’ exchange happens. Now currentNode points to ‘3’, and compareMe to ‘5’. The list becomes: ‘1->2->3->5’.
Iteration 4(outer loop, last iteration): Now currentNode is pointing at 5, and so is compareMe. Thus, the loops come to end, and the list is sorted.
void displayList()
{
node *currentNode = startList;
if(currentNode == NULL)
{ std::cout<<std::endl<<"\aList Empty\a"<<std::endl; }
else
{
std::cout<<std::endl;
while(currentNode != NULL)
{
std::cout<<currentNode->data<<"->";
currentNode=currentNode->next;
}
std::cout<<"End of List"<<std::endl;
}
} ->This is the function that will be used for traversal of the linked list. We would display the elements of the list as we traverse it. In the start of the function, we have assigned a new pointer, ‘currentNode’, to point to the root node, ‘startList’. Then, we check if the list is empty by checking if the currentNode is pointing to null. If currentNode is not pointing to NULL, we traverse the list using a while loop. We check until the currentNode points to null, we display the ‘data’ of the node pointed to by ‘currentNode’, followed by setting ‘currentNode’ to point to the next node in sequence. For better presentation, we separate each element by an arrow ‘->’ printing it after printing the data of each node. And thus we print ‘End of List’ at the end. Both these things we have added for presentation purposes only.
do{..}while() -> The program loop which encapsulates the whole program. Until the user chooses to exit the program, the control loops within this.
exit(0); -> This function is used to exit the program with an error code as it's argument. '0' implies normal exit. Other values are used for debugging purposes.
std::cin.get() -> This statement is used to pause our program, until user presses a key. This function is not necessary in your program, I use it to see my outputs at a paused screen. If you use cmd to run your programs, you might not need this. If you use linux/unix you might not need this. Moreover, removing this line of code from this program, doesn't affect the functionality of the program.
Output(s)
Download Source Code
