String Selection Sort
Modify the selectionSort function presented in this chapter so it sorts an array of strings instead of an array of ints. Test the function with a driver
Program 8-8
#include <iostream>
#include <string>
using namespace std;
int main()
{
const int NUM_NAMES - 20;
string names[NUM NAMES] = {“Collins, Bill”, “Smith, Bart”, “Allen, Jim”,
“Griffin. Jim”, “Stamey, Marty”, “Rose, Geri”,
“Taylor, Terri”, “Johnson, Jill”.
“Allison, Jeff”, “Looney, Joe”, “Wolfe, Bill”,
“James, Jean”, “Weaver, Jim”, “Pore, Bob”,
“Rutherford, Greg”, “Javens, Renee”,
“Harrison, Rose”, “Setzer, Cathy”,
“Pike, Gordon”, “Holland, Beth” };
// Insert your code to complete this program
return 0;
}
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
STARTING OUT WITH C++: >CI<
Additional Engineering Textbook Solutions
Starting Out with C++: Early Objects
Web Development and Design Foundations with HTML5 (8th Edition)
Programming in C
Modern Database Management
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
Starting Out with Java: From Control Structures through Objects (6th Edition)
- Array Processing. In this problem, you have two tasks: To create the header file, arrayOptn.h, and add the function declarations of the following functions listed below. To create the file, arrayOptn.c, which implements the functions in the arrayOptn.h You are already provided with the main() function. Do not edit anything there in the main.c file. 7 - int insertAtPos(int arr[], int *count, int elem, int k) Parameters: int arr[] - a reference to the array where we insert the element int *count - a pointer to the current number of elements in the array int elem - the element to be inserted int k - the index position where the element will be inserted Description: Inserts the element at the kth index of the array and moves all the elements to the right starting at the kth position. For example, if k is 3, the current element at index 3 will be moved to index 4, the current element at index 4 will be moved to index 5, the current element at index 5 will be moved to index 6, and…arrow_forwardPointers reduce the length and complexity of programs. Demonstrate a program to find a maximum and minimum element from an array by passing an array into a function using a pointer.arrow_forwardC++ PROGRAMMING (Linked list) complete the functions: You have to continue on implementing your Array List namely the following functions: Example ArrayList: [10, 30, 40, 50] void addAt(int num, int pos) This method will add the integer num to the posth position of the list. Performing addAt(20, 2) in the example list will add 20 at the 2nd position and the array will now look like this: [10, 20, 30, 40, 50] When the value of pos is greater than the size + 1 or less than one, output "Position value invalid" void removeAt(int pos) Removes the number in the posth position of the list. Performing removeAt(3) in the example list will remove the 3rd element of the list and the updated array will be: [10, 30, 50] When the value of pos is greater than the size or less than one, output "Position value invalid" My incomplete code: #include <cstdlib>#include <iostream>using namespace std; class ArrayList : public List { // : means "is-a" / extend int* array; int index;…arrow_forward
- Given the following struct definition; #define MAX 20 typedef struct{ int items[MAX]; int count;}Array;Define the functions:void addItem(Array *a, int item); // adds item to the arrayvoid printArray(Array a); // displays elements of itemsint isFull(Array a); //returns 1 if the items is full; 0 if otherwiseint isEmpty(Array a); //returns 1 if the items is empty; 0 if otherwisearrow_forwardC++ Sort a vector Define a function named SortVector that takes a vector of integers as a parameter. Function SortVector() modifies the vector parameter by sorting the elements in descending order (highest to lowest). Then write a main program that reads a list of integers from input, stores the integers in a vector, calls SortVector(), and outputs the sorted vector. The first input integer indicates how many numbers are in the list. Ex: If the input is: 5 10 4 39 12 2 the output is: 39,12,10,4,2, For coding simplicity, follow every output value by a comma, including the last one. Your program must define and call the following function:void SortVector(vector<int>& myVec) #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() { /* Type your code here */ return 0;} Enter program input - 5 10 4 39 12 2arrow_forwardC code Blocks Write the complete function that receives a pointer to the array's first element as an argument and multiplies the third element of the array by 10. Define your function in the same way as the given function prototype. Take a look at the "For example" below to see how the function is used in the main function and the expected result. #include <stdio.h>#include <stdlib.h>void multiplyElement(int *ptr);int main(){ int array[5] = {1,2,3,4,5}; int *arrPtr = NULL; arrPtr = &array[0]; multiplyElement(arrPtr); for(int i = 0; i < 5; i++){ printf("%d ", array[i]); }return 0;}//Your answer starts here For example: Test Result int array[5] = {1,2,3,4,5}; int *arrPtr = NULL; arrPtr = &array[0]; multiplyElement(arrPtr); for(int i = 0; i < 5; i++){ printf("%d ", array[i]); } 1 2 30 4arrow_forward
- Language: JAVA Script write a function 'keyValueDuplicates (obj) that takes an object as an argument and returns an array containing all keys that are also values in that object. Examples: obj1 = { orange: "juice", apple: "sauce", sauce: "pan" }; console.log(keyValueDuplicates (obj1)); // ["sauce"] obj2 = { big: "foot", foot: "ball", ball: "boy", boy: "scout"};console.log(keyValueDuplicates(obj2)); // ["foot", "ball", "boy"] obj3 = { pizza: "pie", apple: "pie" pumpkin: "pie"); console.log(keyValueDuplicates (obj3)); // [] *******************************************************************/function keyValueDuplicates (obj) { | // Your code here } /*****DO NOT MODIFY ANYTHING UNDER THIS LINE*********/ try { | module.exports = keyValueDuplicates; } catch (e) { | module.exports = null;}arrow_forwardA struct to store a single playing card is as follows: struct card { char suit; char kind; }; The valid suits are 'S', 'H', 'D' and 'C', while the valid kinds are 'A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', and 'K'. A poker hand can be stored as an array of five struct cards. A flush is a hand that contains five cards, all of the same suit. Write a function that returns 1, if the poker hand passed to it has five cards of the same suit, and 0 otherwise. int isFlush(struct card hand[]); int isFlush(struct card hand[]) {arrow_forwardT/F 1) Arrays have a built-in function toString() { [native code] } form that returns the array's elements as a single String with a “n” between each group.arrow_forward
- create a c++ struct student which has student id, name and cgpa as members. create a static array of size 05 of type struct student. write a function input_record for taking record of 05 students. write a function display to print contents of array on output screen.arrow_forwardPHP Write a modeMaker function Write a function modeMaker() that forms a closure such that the function it returns can be used with your reduce() function above to find the mode of an array. The mode of an array is the value that appears the most frequently (so in the $arr above, the mode is 5). To do this, you will need an array called $seen that keeps the count of times an element has been examined At the end of the reduce function, the $seen array should look like the following for the $arr above: Array ( [10] => 1 [5] => 3 [3] => 1 [1] => 1 [2] => 1 [7] => 1 ) Note that the closure you generate should always be returning the current mode for what it has seen so far (so it will either be the current mode, or the new element passed in). The following is a start for modeMaker: function modeMaker() { $seen = array(); return function($current, $new) use (&$seen) { // your code that uses $seen goes here }; } $mode =…arrow_forwardplease only c code dont use c++ and c#. Function write the arraylist_sort function and arraylist_remove_duplicates according to the given parameters. #include <stdio.h>#include <stdlib.h>#include <string.h> #define N 2000#define D 250 // A simple restaurant structuretypedef struct{char restaurant_name[15];double rating;char city[31];unsigned short opening_year;} RESTAURANT_t, *RESTAURANT; // Arraylist structuretypedef struct ArrayList_s{void **list;int size;int capacity;int delta_capacity;} ArrayList_t, *ArrayList; * Function: arraylist_sort* This generic function sorts an array list using the given compare function.*/void arraylist_sort(ArrayList l, int (*compare)(void *, void *)){// TODO: Fill this block./* NOTE: If you cannot write down a generic function which works for all types, write down a function which sorts resturants. If you cannot use function pointers, you can write down multiple functions which sort using different criteria.*/ } /*** Function:…arrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning