Question

Working in C++, Complete the code.

// Lab 9 code

/* Insert leading comments with your name and the date. Describe the purpose of the code. Also, list each pointer and describe how it is used to enable the selection sort for the linked list structure. */

/* Insert code as described by the comments. */

/* Add comments to each line of code that uses a pointer, describing how it is being used. */

#include <iostream>

using namespace std;

struct Node

{

int data; //the data part of the Node.

Node *next; //Pointer to the next node.

};

Node *head = NULL;

int getData()

{

int data;

cout << "Input an integer as data: ";

cin >> data;

return data;

}

void addData(Node *targetNode, int data)

{

/* Add one line of code here that adds data to the linked list */

}

void createNewNode(Node *prevNode)

{

Node *newNode = new Node;

addData(newNode, getData()); //storing data to the new node.

/* Add two lines of code that properly set the pointers for the new and the previous node. */

}

void createList(int total)

{

Node *Current = head = new Node;

addData(Current, getData());

/* Add a loop that create the required number of nodes (based on the parameter “total”) for the linked list using the function createNewNode.*/

}

void showList()

{

Node *Current = head;

cout << "Showing the linked list:" << endl;

if(Current == NULL)

{

cout << "Empty list!" << endl;

return;

}

while(Current != NULL)

{

cout << Current -> data << " ";

Current = Current -> next; //Now, Current pointer is pointing it next Node.

}

cout << endl;

}

void selectionSort()

/* Complete the code to execute s selection sort using pointers to the linked list. */

{

Node *selectedNode = head;

while(selectedNode -> next != NULL)

{

Node *currentNode = selectedNode;

Node *minimumNode = currentNode;

int minimumData = currentNode -> data;

/* Write code that traverses the linked list and compares the data of the nodes to find the minimum and appropriately set “minimumData” and “minimumNode”. */

/* Write code that sets up the sorted list by setting the data for “selectedNode” to the value of the minimum node, appropriately resetting the minimum node, and moving to the next “selected node” to continue the sort.”

int main()

{

createList(5);

showList();

selectionSort();

showList();

return 0;

}

Answer 1

// Lab 9 code

/* Insert leading comments with your name and the date. Describe the purpose of the code. Also, list each pointer and describe how it is used to enable the selection sort for the linked list structure. */

/* Insert code as described by the comments. */

/* Add comments to each line of code that uses a pointer, describing how it is being used. */

#include <iostream>

using namespace std;

struct Node

{

int data; //the data part of the Node.

Node *next; //Pointer to the next node.

};

Node *head = NULL;

int getData()

{

int data;

cout << "Input an integer as data: ";

cin >> data;

return data;

}

void addData(Node *targetNode, int data)

{

targetNode -> data = data;

}

void createNewNode(Node *prevNode)

{

Node *newNode = new Node;

addData(newNode, getData()); //storing data to the new node.

newNode -> next = NULL;
prevNode -> next = newNode;

}

void createList(int total)

{

Node *Current = head = new Node;

addData(Current, getData());

for(int i = 1; i < total; i++){
createNewNode(Current);
Current = Current -> next;
}

}

void showList()

{

Node *Current = head;

cout << "Showing the linked list:" << endl;

if(Current == NULL)

{

cout << "Empty list!" << endl;

return;

}

while(Current != NULL)

{

cout << Current -> data << " ";

Current = Current -> next; //Now, Current pointer is pointing it next Node.

}

cout << endl;

}

void selectionSort()

/* Complete the code to execute s selection sort using pointers to the linked list. */

{

Node *selectedNode = head;

while(selectedNode -> next != NULL)

{

Node *currentNode = selectedNode;

Node *minimumNode = currentNode;

int minimumData = currentNode -> data;

/* Write code that traverses the linked list and compares the data of the nodes to find the minimum and appropriately set “minimumData” and “minimumNode”. */
while(currentNode != NULL)
{
if(minimumData > currentNode -> data)
{
minimumData = currentNode -> data;
minimumNode = currentNode;
}

currentNode = currentNode -> next;
}
int tempSwap = minimumNode -> data;
minimumNode -> data = selectedNode -> data;
selectedNode -> data = tempSwap;
selectedNode = selectedNode -> next;
}
}
/* Write code that sets up the sorted list by setting the data for “selectedNode” to the value of the minimum node, appropriately resetting the minimum node, and moving to the next “selected node” to continue the sort.”*/

int main()

{

createList(5);

showList();

selectionSort();

showList();

return 0;

}