C++ code! we'll give thumbs ups!

Implement a city database using unordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as x and y coordinates. Your database should allow records to be inserted, deleted by name or coordinate, and searched by name or coordinate. Implement the database using an array-based list implementation, and then a linked list implementation. Collect running time statistics for each operation in both implementations. And think:

• What are your conclusions about the relative advantages and disadvantages of the two implementations?

• Would storing records on the list in alphabetical order by city name speed any of the operations?

• Would keeping the list in alphabetical order slow any of the operations?

• Written Report: should contain following points orderly

  • Introduction to the project framework, i.e., how is the framework designed? How many modules does it contain? And what are the relations between any two modules? A figure that shows the whole framework is preferred.

  • The execution results of the built system. Take a snapshot for the results and paste them in the report. Each result should be explained, i.e., the input for the results and their meaning.

  • Introduction to those key classes. How were they designed? What members do they contain? And for each member, what is its design purpose?

  • The conclusion and the future work about the project.