Starting Out with C++: Early Objects (9th Edition)
9th Edition
ISBN: 9780134400242
Author: Tony Gaddis, Judy Walters, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 9, Problem 2RQE
Program Description Answer
The “Binary search” will divide or partition the given array based on the middle element and performs search either on the first half or in the second half based on the value that is searched.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
T/F
9) All dimensions of a two-dimensional array must have the same number of components, as seen in[10][10].
1. Sorting• Begin by filling an array with random numbers:import numpy as npnp.random.seed(1012)DATASIZE = 1000MAX_VALUE = 10000000data = np.random.randint(0, MAX_VALUE, size=DATASIZE)• Write a function that is passed a numpy array. The function should walkthrough the array element-by-element, comparing the current element tothe next element. Swap if the next is smaller than the current – sortingthese two elements.• Write a second function that calls the above function n times, where n isthe number of elements (size) of the array. Pass the same numpy arrayeach time.
2. Bubble Sort• The sort from part 1 can be improved. If the data passed to be sorted isalready sorted, it still performs all of the work, as if the array was notsorted.Make two improvements:• Change the first function (the one that does the comparisons), so that it returns aboolean that states whether the array is sorted. Make use of that boolean to stopcalling the first function if the array is sorted.• Consider…
1. Sorting• Begin by filling an array with random numbers:import numpy as npnp.random.seed(1012)DATASIZE = 1000MAX_VALUE = 10000000data = np.random.randint(0, MAX_VALUE, size=DATASIZE)• Write a function that is passed a numpy array. The function should walkthrough the array element-by-element, comparing the current element tothe next element. Swap if the next is smaller than the current – sortingthese two elements.• Write a second function that calls the above function n times, where n isthe number of elements (size) of the array. Pass the same numpy arrayeach time.
Chapter 9 Solutions
Starting Out with C++: Early Objects (9th Edition)
Ch. 9.2 - Prob. 9.1CPCh. 9.2 - Prob. 9.2CPCh. 9.2 - Prob. 9.3CPCh. 9.2 - Prob. 9.4CPCh. 9.3 - True or false: Any sort can be modified to sort in...Ch. 9.3 - Prob. 9.6CPCh. 9.3 - Prob. 9.7CPCh. 9.3 - Prob. 9.8CPCh. 9.3 - Prob. 9.9CPCh. 9.6 - Prob. 9.10CP
Ch. 9.6 - Prob. 9.11CPCh. 9.6 - Prob. 9.12CPCh. 9.6 - Prob. 9.13CPCh. 9.6 - Prob. 9.14CPCh. 9.6 - Prob. 9.15CPCh. 9 - Prob. 1RQECh. 9 - Prob. 2RQECh. 9 - Prob. 3RQECh. 9 - Prob. 4RQECh. 9 - Prob. 5RQECh. 9 - Prob. 6RQECh. 9 - Prob. 7RQECh. 9 - A binary search will find the value it is looking...Ch. 9 - The maximum number of comparisons that a binary...Ch. 9 - Prob. 11RQECh. 9 - Prob. 12RQECh. 9 - Bubble sort places ______ number(s) in place on...Ch. 9 - Selection sort places ______ number(s) in place on...Ch. 9 - Prob. 15RQECh. 9 - Prob. 16RQECh. 9 - Why is selection sort more efficient than bubble...Ch. 9 - Prob. 18RQECh. 9 - Prob. 19RQECh. 9 - Prob. 20RQECh. 9 - Prob. 21RQECh. 9 - Charge Account Validation Write a program that...Ch. 9 - Lottery Winners A lottery ticket buyer purchases...Ch. 9 - Lottery Winners Modification Modify the program...Ch. 9 - Batting Averages Write a program that creates and...Ch. 9 - Hit the Slopes Write a program that can be used by...Ch. 9 - String Selection Sort Modify the selectionSort...Ch. 9 - Binary String Search Modify the binarySearch...Ch. 9 - Search Benchmarks Write a program that has at...Ch. 9 - Sorting Benchmarks Write a program that uses two...Ch. 9 - Sorting Orders Write a program that uses two...Ch. 9 - Ascending Circles Program 8-31 from Chapter 8...Ch. 9 - Modified Bin Manager Class Modify the BinManager...Ch. 9 - Using Files-Birthday List Write a program that...Ch. 9 - Prob. 14PCCh. 9 - Using Files-String Selection Sort Modification...Ch. 9 - Using Vectors String Selection Sort Modification...
Knowledge Booster
Similar questions
- іmрlеmеոt thе fоllоwіոg ехрrеssіоո іո аssеmbly lаոguаgе: Create a DWORD array named ‘z’ of size 3 using DUP operator. Leave the array ‘z’ uninitialized. You can denote the items in the array as [ z0, z1, z2]z0, z1, z2] , where z0z0 is the first item, z1 z1 is the second item, z2z2 is the third item Update each array item using the following expressions. z0=x+130z0=x+130 z1=y−x+ z0z1=y−x+ z0 z2=r+x−z1z2=r+x−z1 Where x, y, r are 16-bit integer memory variables. x = 10, y = 15, r = 4 Use mov, movzx, movsx, add, sub instructions only. (hint: Do not alter the value of x, y and r during the computation. Transfer them to appropriate registers to do computation) At the end, open memory window to see the variable z stored in memory (little endian format). Use the debugger to verify your answer.arrow_forwardLanguage 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…arrow_forwardGiven the following search pattern: AACAAABA1- create the KMP next array.2- Using the search pattern and the array you created, perform a search on the following block of text: AACAACAAABAY3- Mention exactly how many comparisons were made.arrow_forward
- C Program Bubble Sort Write a program that continuously accepts integer user input and assign the value in an array with a size of 100. The input process terminates if either of the following is true: inputted value is 0 input count is greater than 100 Sort the values inside the array in ascending order using the bubble sort algorithm. Print out the sorted values inside the pair of square brackets [ ] where the elements are separated by a comma and a space ", " Input 1. Multiple lines containing an integer Output Enter number 1: 1 Enter number 2: 2 Enter number 3: 3 Enter number 4: 4 Enter number 5: 5 Enter number 6: 0 [1, 2, 3, 4, 5]arrow_forwardquery the user for the size of an array of integers build an array of integers and fill it with random integer values. The values will range between 0 and 100 display the array clone the array display the cloned array sort the cloned array display the original array and the sorted cloned array create another array that is double the size of the cloned array and copy the data from the cloned array into the new array. Then fill the remaining cells in the new array with random values. These will also range between 0 and 100.Note: int[] newArray = new int[clone.lenght*2] Write program in jvaarrow_forwardWrite code for a sequential search that determines whether the value −1 is stored in an array with a reference variable named values. The code should display a message indicating whether the value was found.arrow_forward
- C++ LANGUAGE Search Metrics In this exercise you will explore the performance difference between sequential search and binary search. To do so write a program that performs the following tasks: Prompt the user for a file containing 100,000 unsorted integers Read those integers into an array Prompt the user for a search item Search for that item (using sequential search) and report the number of comparisons required. Sort the array. Note that this might take a few minutes. Search for that item again (using binary search) and report the number of comparisons required. You will need to modify both of the search functions to report the number of comparisons that were made during the search. Use your program and the file of 100,000 integers provided here to answer the six questions in the quiz. May i know whats the program please?arrow_forwardTrue or False A jagged array is similar to a two-dimensional array, but the rows in a jagged array can have different numbers of columns.arrow_forwardFinal review ch6-7 Using arrays create a personal phone directory that contains room for first names and phone numbers for 20 people. Using the "names.txt" retrieve the first name and phone number for each person and store in arrays (parallel). Prompt the user for a name, search for the name, and if name is found in the array, display the corresponding phone number. If the name is not found, prompt the user to enter 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 or until arrays are full. After the arrays are full (containing 20 names), do not allow the user to add new entries. Print the full list. "names.txt" Denton (123)-456-7890 Francis (123)-456-7891 Lucy (123)-456-7892 Brooklyn (123)-456-7899 Mattie (123)-456-7898 Clarissa (123)-456-7897 Bailey (123)-456-7896 Lesley (123)-456-7895 Tristan (123)-456-7894 Bethany (123)-456-7893arrow_forward
- IN MATLAB SOFTWARE answer the task 6 I need the codes to be use Task 5 Create a 1-by-1000 row vector called M containing random integer numbers between 8 and 256. Using logical array indexing, assign all elements with value greater than 200 to a variable called up200. Display the dimension of variable up200. Task 6 Continuing previous task, create another variable called up100 containing all elements in M that are greater than 100 but less than 200. Display the dimension of vector up100. Append variable up200 to variable up100.arrow_forwardJAVA CODE PLEASE 2. Bubble Sort Practice ll by CodeChum Admin Write a program that continuously accepts integer user input and assign the value in an array with a size of 100. The input process terminates if either of the following is true: inputted value is 0 input count is greater than 100 Sort the values inside the array in ascending order using the bubble sort algorithm. Print out the sorted values inside the pair of square brackets [ ] where the elements are separated by a comma and a space ", " Input 1. Multiple lines containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4 Enter·number·5:·5 Enter·number·6:·0 [1,·2,·3,·4,·5]arrow_forwardProgramming Language: C++ You have been hired by Google to work on their YouTube videos search team. Every YouTube video has a unique ID and those IDs are in unsorted order. As a software engineer, you are required to make a YouTube search engine which works for very user. Create a test engine that only holds seven YouTube IDs. Prompt for and get from the user the seven IDs and store them in an integer array. Then sort and print the array using the insertion sort algorithm. Finally, use a sentinel loop to prompt for and get from the user a series of IDs. For each ID, perform a binary search on the array and tell the user if it was found or not. If found, print the index where the ID is stored. Continue to prompt the user for an ID until entering the sentinel value of -999. In addition to function main, define the following two functions: void insertion_sort(int arr[], int arr_size) int binary_search(int sort_arr[], int size_array, int search_value) binary_seacrh returns…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,