Question

Instructions: In this lab, we are going to review shell sort.

Get into groups of at most two people to accomplish this lab.
At the top of your source code files list the group members as a comment.
Each member of the group must individually submit the lab in Canvas.
• This lab includes 18 points in aggregate. The details are given in the following.
1 city.h
Use city.h from the previous lab without any modifications.
2 main.cpp
In main.cpp do the following step by step:
1. Globally define array cityArray[] consisting of cities with the following details:
(a) Los Angeles with population of 4 million
(b) San Diego with population of 1.5 million
(c) San Francisco with population of 900 thousand
(d) Sacramento with population of 500 thousand
(e) Stockton with the population of 300 thousand
(f) Redding with the population of 90 thousand
(g) Las Vegas with the population of 700 thousand
(h) Reno with the population of 300 thousand
(1) Portland with the population of 700 thousand
(1) Seattle with the population of 750 thousand
(k) Eugene with the population of 200 thousand
2. Globally define the array of gap values gaps [] consisting of 4, 2, and 1 in order.
3. Globally define a vector of City objects, without initial values. Call it cityVector (/ points).
4. Pass vectors to these functions as reference, and define them as constant if the functions are not
allowed to modify them.
(a) Define function void initVector (...) that receives a vector of City objects, an array of elements of type City as a second input, and an integer as its third input. The third input represents the number of elements in the input array. Initialize the input queue with the elements existing in the input array (2 points).
(b) Define function void printCityVector (...) that receives a vector of City objects as input and prints the elements within the vector. Hint: You can use range-based for loops (2 points).
(c) Define function void cityInterleavedInsertionSort (...) that receives a vector of City objects as input, along with an integer that represents the starting index, and another integer that represents the gap size. It does interleaved insertion sort on the vector according to the city populations, and the two integer inputs (5 points).

Answer 1

The lab involves implementing a shell sort algorithm in C++, define a city array with specific details, and write functions to initialize and sort a vector of City objects based on their populations.

Step-by-step explanation:

A lab activity that requires implementing a shell sort algorithm in C++, focusing on sorting objects instead of primitive data types. In this lab, you're asked first to globally define an array cityArray[] with specific cities and populations. Then, you need to create an array of gap values gaps[] according to the shell sort algorithm. Finally, you'll define a vector of City objects and write functions to initialize this vector with the cityArray, print its contents, and sort it using a modified insertion sort that accounts for gaps between elements.

To accomplish these tasks:

1. Define cityArray[] with the cities and populations provided.
2. Define gaps[] with gap values 4, 2, and 1.
3. Declare a vector cityVector to store City objects.
4. Create the initVector() function to initialize cityVector with array elements.
5. Create the printCityVector() function to display the content of the vector.
6. Develop the cityInterleavedInsertionSort() function to sort the vector using the gap values.

This lab serves as a practical application of the shell sort algorithm in object-oriented programming, exemplifying its operation on complex data types.