#include using namespace std; int c=0; class Node{ public: int value ; Node *ptr ; Node(int value){ this->value = value ; this->ptr = NULL ; } }; class List{ private: Node *head ; public: List(){ head = NULL ; } void addObject(int value){ c++; Node *newNode = new Node(value); if ( head == NULL ) { head = newNode ; } else { Node *currNode = head ; while(currNode->ptr!=NULL){ currNode = currNode->ptr ; } currNode->ptr = newNode ; } } void addObjectInOrder(int value , int index){ c++; Node *xyz = new Node(value) ; if ( index == 1 ){ xyz->ptr = head->ptr ; head = xyz ; } else{ Node *currNode = head ; for(int i=1;iptr ; } xyz->ptr = currNode->ptr ; currNode->ptr = xyz ; } } void DeleteFromTheList(int index){ c--; Node *currNode = head ; if ( index == 1 ){ head = head->ptr ; delete currNode; } else { for(int i=1;iptr ; } Node *tmpNode = currNode->ptr ; currNode->ptr = tmpNode->ptr ; delete tmpNode ; } } int searchInTheList(int value){ int index = 1 ; Node *currNode = head ; while(currNode!=NULL){ if ( currNode->value == value ){ return index ; } else { index++; } currNode = currNode->ptr; } return -1 ; } void sortTheList(){ for(Node *i = head ; i!=0 ; i = i->ptr){ for(Node *j = head; j!=0; j = j->ptr){ if ( i->value < j->value ){ swap(i->value,j->value); } } } } void displayMyList(){ Node *currNode = head ; while(currNode!=NULL){ cout << currNode->value << endl; currNode = currNode->ptr ; } } void listClear(){ List mylist; for(int i=1;i>>> |"<>>>> |"<>>> |"<

Market'sShoppingListERRORl103