Question

16 and 18 C++

11. Given the dynamic linked implementation of a linked list shown below, write expressions that do the following, assuming that currPtr is somewhere in the middle of the list: a. Access the component member of the first list element. b. Advance currPtr to point to the next element. c. Access the component member of the next element (the one that follows the current element). d. Access the component member of the element that follows the next element. typedef int componentType; struct Node Type: typedef Node Type NodePtr: struct Node Type ComponentType component: Node Ptr link: NodePtr lastPtr: NodePtr listPtr: NodePtr currPtr: NodePtr new NodePtr: 12. Given the declarations in Exercise 11, write a code segment that creates a new node, assigns the value 100 to the component member, links listPtr to the new node, and sets currPtr to also point to the node. 13. Given the declarations in Exercise 11, and the fact that the first node has been inserted into the list as in Exercise 12, write a code segment that creates a new node with the component value equal to 212 and inserts this node at the end of the list, updating any pointers as necessary. 14. Given the declarations in Exercise 11, assume that the list has a large collection of members and that currPtr is somewhere in the middle of the list. Write a code segment to insert a new node with the component value of 32 following the node pointed to by currPtr, and update currPtr to point to the new node. 15. Given the declarations in Exercise 11, assume that the list has a large collection of members and that currPtr is somewhere in the middle of the list. Write a code segment to remove the node following the node pointed to by currPtr and reinsert it at the head of the list. 16. Given the declarations in Exercise 11, write a void function that sorts the elements of the list in ascending order. The sort algorithm will scan the list, keeping a pointer to the lowest value seer thus far. When the end of the list is reached, the lowest value will be removed from that point and inserted at the end of a new list. After all of the elements have been moved from the original list to the new sorted list, change listPtr and currPtr to point to the first element of the new list. That way, when the function returns, the client code will simply see the list as having been sorted.

Answer 1

//16 CODE HAS BEEN IMPLEMENTED, DO CHECK ONCE BY YOUR OWN

/*
   struct NodeType{
       ComponentType component;
       NodePtr link;
   }
  
   NodePtr listPtr;
   NodePtr currPtr;
   NodePtr newNodePtr;
*/

void sortList(){
   if(listPtr == null){
       return;
   }
  
   NodePtr newListPtr = null;
   NodePtr newCurrPtr = null;
   NodePtr curr = listPtr;
   Nodeptr temp,prev;
  
   while(curr!=null){
       prev = null;
       temp = curr;
       while(curr->link){
           if( (temp->component) > (curr->link->component) ){
               temp = curr->link;
               prev=curr;
               curr=curr->link;
           }
       }
      
       //CREATE NODE --- THIS FOR CREATING NEW NODE
       /*
       struct NodePtr newNodePtr = (struct NodePtr) malloc(sizeof(struct NodeType));
       newNodePtr->component = temp->component;
       */
      
       if(newListPtr == null){
           newListPtr = temp;
           newCurrPtr = temp;
          
       }else{
           newCurrPtr->link=temp;
           newCurrPtr=temp;
       }
      
       //MOVE NODE
       if(prev == null){
           listPtr = listPtr->link;
           temp->link = null;
       }else{
           prev->link = temp->link;
           temp->link = null;
       }
      
       //REMOVE NODE --- THIS IS FOR DELETING NODE
       /*
       if(prev==null){
           listPtr = listPtr->link;
           free(temp);
       }else{
           prev->link = temp->link;
           free(temp);
       }*/
      
       curr = listPtr;
   }
  
   listPtr = newListPtr;
   currPtr = newListPtr;
}