Chapter 17, Problem 10PC

Program Plan Intro

List Sort

Program Plan:

• Include the required specifications into the program.
• Declare a class ListNode.
  • Declare the member variables “value” and “*p” in structure named “ListNode”.
  • The data value of node is stored in variable v and address to next pointer is stored in pointer p
  • Declare the constructor, destructor, and member functions in the class.
  • Declare the structure variable “next” and a friend class Linked List
• Declare a class LinkList.
  • Function to check whether a particular node with a data value n is a part of linked list or not “bool isMember(double n)”.
  • A recursive print method is defined to print all the data values present in the link list “void rPrint()”.
  • A link list method to insert elements into the link list called “void LinkedList::insert(double x, int pos)” is called that insert elements into the link list at specific positions.
  • A link list method called “void LinkedList::sort()” to sort all the elements present in the list according to their data values and then print the sorted list.
  • A link list method to remove elements from the link list called is called

    “void LinkedList::removeByPos(int pos)” that removes elements from the link list at specific positions.

  • A method to search for an element present in the link list called “ int LinkedList::search(double x)” is called that returns the position of the element present in the link list.
  • A destructor is called to delete the desired data value entered by the user called   “LinkedList::~LinkedList( )”.
  • A method to remove the element passed as a parameter from the link list is called “void LinkedList::remove(double x)”.
  • Declare a method “void reverse( )”  to reverse the elements present in the link list by traversing through the list and Move node at end to the beginning of the new reverse list being constructed.
  • Declaration of structure variable head to store the first node of the list “ListNode * head” is defined.
  • A function “void LinkedList::add(double n)” is defined which adds or inserts new nodes into the link list.
  • A function “bool LinkedList::isMember(double n)” is defined which  searches for a given data value within the nodes present in the link list.
  • A destructor “LinkedList::~LinkedList()” deallocates the memory for the link list.
  • A function “void LinkedList::print()” is used to print all the node data values present in the link list by traversing through each nodes in the link list.
  • A recursive member function check is defined called “bool LinkedList::rIsMember(ListNode *pList,double x)” .
    • If the data value entered is present within the link list, it returns true, else it returns false.
• Declare the main class.
  • Create an empty list to enter the data values into the list.
  • Copy is done using copy constructor.
  • Input “5” numbers from user and insert the data values into the link list calling “void LinkedList::add(double n)” function.
  • Print the data values of the nodes present in the link list.
  •  “int LinkedList::search(double x)” function is called to search the element present in the link list and prints the position of the element.
  • “void LinkedList::removeByPos(int pos)” function is called to remove elements from the link list at specific positions.