Implement a city database using unordered lists

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 implemen running time statistics for each operation in both implementations. And think: What are your conclusions about the relative advantages ntation, and then a linked list implementation. Collect 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? and disadvantages of the two implementations? Project 2: Implement an electronic dictionary system where users can store and retrieve items, e.g. and choose the appropriate data structures you h trees, etc, can be applied to different scenarios. You should firstly design the interfaces that you want to implement ures to help you fulfill the tasks. Though the topie is given, many open issues could be discovered and solved. 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 implemen running time statistics for each operation in both implementations. And think: What are your conclusions about the relative advantages ntation, and then a linked list implementation. Collect 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? and disadvantages of the two implementations? Project 2: Implement an electronic dictionary system where users can store and retrieve items, e.g. and choose the appropriate data structures you h trees, etc, can be applied to different scenarios. You should firstly design the interfaces that you want to implement ures to help you fulfill the tasks. Though the topie is given, many open issues could be discovered and solved