Chapter 9, Problem 3RQ

A personal phone directory contains room for first names and phone numbers for 30 people. Assign names and phone numbers for the first 10 people. Prompt the user for a name, and if the name is found in the list, display the corresponding phone number. If the name is not found in the list, prompt the user for a phone number, and add the new name and phone number to the list. Continue to prompt the user for names until the user enters quit. After the arrays are full (containing 30 names), do not allow the user to add new entries.

A personal phone directory contains room for first names and phone numbers for 30 people. Assign names and phone numbers for the first 10 people. Prompt the user for a name, and if the name is found in the list, display the corresponding phone number. If the name is not found in the list, prompt the user for a phone number, and add the new name and phone number to the list. Continue to prompt the user for names until the user enters quit. After the arrays are full (containing 30 names), do not allow the user to add new entries. Use the following names and phone numbers: Name Phone # Gina (847) 341-0912 Marcia (847) 341-2392 Rita (847) 354-0654 Jennifer (414) 234-0912 Fred (414) 435-6567 Neil (608) 123-0904 Judy (608) 435-0434 Arlene (608) 123-0312 LaWanda (920) 787-9813 Deepak (930) 412-0991     import java.util.*; class PhoneNumbers {     public static void main(String[] args) {         // Write your code here     } }

#include <iostream> #include <string> #include <ctime> using namespace std; void displayArray(double * items, int start, int end) { for (int i = start; i <= end; i++) cout << items[i] << " "; cout << endl; } //The legendary "Blaze Sort" algorithm. //Sorts the specified portion of the array between index start and end (inclusive) //Hmmm... how fast is it? /* void blazeSort(double * items, int start, int end) { if (end - start > 0) { int p = filter(items, start, end); blazeSort(items, start, p - 1); blazeSort(items, p + 1, end); } } */ int main() { //////////////////////////////////////////////////// //Part 1: Implement a method called filter. //////////////////////////////////////////////////// //Filter is a function that takes in an array and a range (start and end). // //Call the first item in the range the 'pivot'. // //Filter's job is to simply separate items within the range based on whether they are bigger or smaller than the pivot. //In…

1. You have an array of 4 ints which is sorted from lowest to highest.  You also have a function which runs a bubble sort to sort items from lowest to highest.  If you run this function on your array, the function will do at least one swap.   A) True   B) False

Below you will find code blocks necessary to insert a value into an ordered array given a position (index) to insert. Be careful! Some lines are not needed.

Below you will find code blocks necessary to insert a value into an ordered array given a position (index) to insert. Be careful! Some lines are not needed. first line COMPLETED: bool insertElement(char array[ ], int& numElems, int &capacity, in position, char value) { last line COMPLETE: bool insertElement(char array[ ], int numElems, int capacity, in position, char value) {

Language is C++  Lab10B: Binary Bubbles. Binary search is a very fast searching algorithm, however it requires a set of numbers to be sorted first. For this lab, create an array full of 11 integers which the user will generate. Like in the previous lab, assume that the values will be between -100 and +100. Then, using the sorting algorithm called BubbleSort, put the array in the correct order (from lowest to highest number). After this, please printthe array to the screen. Finally, search the array for the target value using Binary Search.The BinarySearch code will implement the algorithm described in the lecture slides. During this, you should print out a few key values which help Binary Search function. For example, this algorithm focuses on a low, mid, and high which correspond to the indices in the array the algorithm is currently considering and searching. Printing these values during the search process will help with debugging and fixing any issues. • BubbleSort sorts the array…

What types of array can be sorted using the java.util.Arrays.sort method? Does this sort method create a new array?

Using the coding C++ below, can you help me use the bubble sort coding to sort NAME ascendingly? Please USE MY CODE and modify it. C++ CODING ONLY, I NEED TO USE THE TEMPLATE IN THE CODING. // BubbleMain.cpp #include #include "Bubble.h" using namespace std; void main() { Bubble sort; cout << "Insert your name : " << endl; for (int i = 0; i < SIZE; i++) { cout << "Name " << i << " : "; cin >> sort.array[i]; } cout << endl; sort.bubblesort(sort.array, SIZE - 1); cout << "Information : " << endl; for (int j = 0; j < SIZE; j++) { cout << "Name " << j << " : "; cout << sort.array[j] << endl; } } Now below is the h file. // Bubble Sort Name ( Ascending ) #ifndef BUBBLE_H #define BUBBLE_H const int SIZE = 6; template class Bubble { public: T array[SIZE]; void bubblesort(T[], int); }; #endif template void Bubble::bubblesort(T list[], int last) { int current, walker, temp; bool sorted; for (current = 0,…