1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build...

   

Transcribed Image Text:

1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build a C++ program based on the appropriate method/function. You are free to create your own menu and display. Consider the following case: User have to input a set of numbers in the linked list. The program should be able to print out and search a number the list. The program can also be able to sort the linked list in ascending order. After that, the program will eliminate any duplicates number from the list, such that output list contains only unique number. The program must consist of the following method function: a) menu()- as interface for the user b) add_list(Node) to add number to the list c) show_list() to display the lists d) search number(Node) - to search a number in the list e) sort_list()-to sort the number in the list f) delete_duplicate()-to eliminate any duplicates number in the list g) delete_list()-to delete the list Example, segment of output: How many numbers you want to enter: 6 Please enter a number: 5 Please enter a number: 7 Please enter a number: 5 Please enter a number: 1 Please enter a number: 3 Please enter a number: 3 Show list: 5-7-5->1-3-3-NULL Find number: 2 2 is not in the list! Sorted list: 1->3-> 3-5-5-7-> NULL Updated list: 1-3-5-7-> NULL Delete list! Declaration node and functions: //declaration of node struct Node( int d_num; Node *dlink; }; void menu (); void add list (Node); void show_list(); void search list (Node); void sort list(); void delete duplicate(); void delete_list(); 1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build a C++ program based on the appropriate method/function. You are free to create your own menu and display. Consider the following case: User have to input a set of numbers in the linked list. The program should be able to print out and search a number the list. The program can also be able to sort the linked list in ascending order. After that, the program will eliminate any duplicates number from the list, such that output list contains only unique number. The program must consist of the following method function: a) menu()- as interface for the user b) add_list(Node) to add number to the list c) show_list() to display the lists d) search number(Node) - to search a number in the list e) sort_list()-to sort the number in the list f) delete_duplicate()-to eliminate any duplicates number in the list g) delete_list()-to delete the list Example, segment of output: How many numbers you want to enter: 6 Please enter a number: 5 Please enter a number: 7 Please enter a number: 5 Please enter a number: 1 Please enter a number: 3 Please enter a number: 3 Show list: 5-7-5->1-3-3-NULL Find number: 2 2 is not in the list! Sorted list: 1->3-> 3-5-5-7-> NULL Updated list: 1-3-5-7-> NULL Delete list! Declaration node and functions: //declaration of node struct Node( int d_num; Node *dlink; }; void menu (); void add list (Node); void show_list(); void search list (Node); void sort list(); void delete duplicate(); void delete_list();