Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Has to be written in C. John works at the Ministry of Tourism and wanted to go to Kemal Square and make a list of

image text in transcribed

Has to be written in C. John works at the Ministry of Tourism and wanted to go to Kemal Square and make a list of the countries from which the tourists who visit the square come from by asking which country they come from. Of course, this process can take days or even weeks. So John needs a program. This program will keep each country John entered, and then print each country once on the screen, listed in alphabetical order. Points we want you to pay attention to: 1. Your solution should definitely be a linked list data structure. 2. As long as John is logged in, place the entries in a conjunction list. Let's call this the main link list. When placing entries in the main list, do not apply any criteria and add the new country directly to the end of the list. 3. When John's entries are done, the system: a. For all countries with more than one bit (duplicate) in your main connector list, it will keep only the first node and delete the others. You have to do this in a separate function. b. It will then read individual countries starting from the first node of your main list and import them into a second linked list. However, while transferring to the second list, the second list will be entered in an alphabetically ordered list. C. Finally, it will display all the countries in the second list in alphabetical order

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Oracle Database Administration The Essential Reference

Authors: Brian Laskey, David Kreines

1st Edition

1565925165, 978-1565925168

Students also viewed these Databases questions