Starting Out with C++
8th Edition
ISBN: 9780133888201
Author: GADDIS
Publisher: PEARSON CUSTOM PUB.(CONSIGNMENT)
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 4PC
Charge Account Validation Modification
Modify the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write 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.
Median Function – In statistics, the median of a set of values is the value that lies in the middle when the values are arranged in sorted order. If the set has an even number of values, the median is the average of the two middle values.
Your program should start with two arrays of integers containing the following values:
Even numbered array: 17 32 45 68 99 101 67 89 22 27
Odd numbered array: 17 32 45 68 99 101 67 89 22
Using a sort function of your choice, first sort the arrays. NOTE: you may use the Standard Template Library sort function or your own sort function.
Then, write a function that determines the median of a sorted array. The function should take an array of numbers and an integer indicating the size of the array and return the median of the values in the array. The same function should be called twice – once for the even array and once for the odd array.
Your program should also have a printArray function that can be used to print the sorted array. (It…
What occurs when a selection sort is applied to an array?
Chapter 8 Solutions
Starting Out with C++
Ch. 8.2 - Prob. 8.1CPCh. 8.2 - Prob. 8.2CPCh. 8.2 - Prob. 8.3CPCh. 8.2 - Prob. 8.4CPCh. 8 - Prob. 1RQECh. 8 - If a linear search function is searching for a...Ch. 8 - Prob. 3RQECh. 8 - A binary search function is searching for a value...Ch. 8 - What is the maximum number of comparisons that a...Ch. 8 - Prob. 6RQE
Ch. 8 - Why is the selection sort more efficient than the...Ch. 8 - Prob. 8RQECh. 8 - The __________ search algorithm repeatedly divides...Ch. 8 - Prob. 10RQECh. 8 - The ____________ search algorithm requires that...Ch. 8 - If an array is sorted in ______________ order, the...Ch. 8 - If an array is sorted in _____________ order, the...Ch. 8 - Prob. 14RQECh. 8 - Prob. 15RQECh. 8 - Prob. 16RQECh. 8 - T F The maximum number of comparisons performed by...Ch. 8 - Prob. 18RQECh. 8 - Charge Account Validation Write a program that...Ch. 8 - Lottery Winners A lottery ticket buyer purchases...Ch. 8 - Lottery Winners Modification Modify the program...Ch. 8 - Charge Account Validation Modification Modify the...Ch. 8 - Rainfall Statistics Modification Modify the...Ch. 8 - String Selection Sort Modify the selectionSort...Ch. 8 - Binary String Search Modify the binarySearch...Ch. 8 - Search Benchmarks Write a program that has an...Ch. 8 - Sorting Benchmarks Write a program that uses two...Ch. 8 - Sorting Orders Write a program that uses two...Ch. 8 - Using FilesString Selection Sort Modification...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Explain why the rapid delivery and deployment of new systems is often more important to businesses than the det...
Software Engineering (10th Edition)
Look at the following class definition. What is the name of the superclass? What is the name of the subclass? c...
Starting Out with Python (3rd Edition)
What is a user interface?
Starting Out with Python (4th Edition)
An active-HIGH pulse (HIGH level when asserted, LOW level when not) is required on an inverter input. Draw the ...
Digital Fundamentals (11th Edition)
The variable a starts with the value 10. The variable b starts with the value 2. The variable c starts with the...
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
What will be the final value of dblResult in the following sequence? Dim dblResult As Double = 3.5 dblResult +=...
Starting Out With Visual Basic (7th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- """ HouseholdSize.py - This program uses a bubble sort to arrange household sizes in descending order and then prints the mean and median household size. Input: Interactive. Output: Mean and median household size. """ # Initialize variables. householdSizes = [] # Array used to store household sizes. numSizes = 0 total = 0.0 mean = 0.0 median = 0.0 # Input household size householdSizeString = input("Enter household size or 999 to quit: ") householdSize = int(householdSizeString) # This is the work done in the fillArray() function while (householdSize != 999): # Place value in array. householdSizes.append(householdSize) # Calculate total of household sizes numSizes += 1 # We have one more house householdSizeString = input("Enter household size or 999 to quit: ") householdSize = int(householdSizeString) # Find the mean # This is the work done in the sortArray() function # This is the work done in the displayArray()…arrow_forwardWhat results may be expected from applying a selection sort to an existing array?arrow_forward1. You have an array of 4 ints which is sorted from highest to lowest. 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 multiple swaps. A) True B) Falsearrow_forward
- Lottery Winners Directions A lottery ticket buyer purchases 10 tickets a week, always playing the same 10 5-digit “lucky” combinations. Write a program that initializes an array or a vector with these numbers and then lets the player enter this week’s winning 5-digit number. The program should perform a linear search through the list of the player’s numbers and report whether or not one of the tickets is a winner this week. Here are the numbers: 13579, 26791, 26792, 33445, 55555, 62483, 77777, 79422, 85647, 93121 Validate the input for the week's winning number. Ensure the input does not crash when entering a character or string value. Make sure to accept only positive numbers. Ask the user for the correct value each time they enter an incorrect one.arrow_forward3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)arrow_forward(Bubble Sort) Implement the bubble sort—another simple, yet inefficient, sorting technique. It’s called bubble sort or sinking sort because smaller values gradually “bubble” their way to the top of the array (i.e., toward the first element) like air bubbles rising in water, while the larger values sink to the bottom (end) of the array. The technique uses nested loops to make several passes through the array. Each pass compares successive overlapping pairs of elements (i.e., elements 0 and 1, 1 and 2, 2 and 3, etc.). If a pair is in increasing order (or the values are equal), the bubble sort leaves the values as they are. If a pair is in decreasing order, the bubble sort swaps their values in the array. The first pass compares the first two elements of the array and swaps them if necessary. It then compares the second and third elements. The end of this pass compares the last two elements in the array and swaps them if necessary. After one pass, the largest element will be in the last…arrow_forward
- Pointers 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++ Lexicographical Sorting Given a file of unsorted words with mixed case: read the entries in the file and sort those words lexicographically. The program should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words. You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat." For example, if the array contains ten words and the contents are cat Rat bat Mat SAT Vat Hat pat TAT eat after sorting, the word at index 6 is Rat You are encouraged to use this data to test your program.arrow_forwardKim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array (use loop); if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting (use for loop), and display of the sorted array. Use javaarrow_forward
- f an array is sorted in this order, the values are stored from highest to lowest.a. asymptoticb. logarithmicc. ascendingd. descendingarrow_forwardIN C# Q. Lucky Number Definition:● A lucky number is a number whose value is equal to the occurrence of that number in anarray.○ [2, 2, 3, 3] => 2● If there is more than one number whose value is equal to the occurrence of that numberin an array, then the lucky number will be the one with the maximum value among alllucky numbers.○ [1, 2, 2, 3, 3, 3, 4] => 3● If there is no number in an array whose value is equal to the occurrence of that numberin the array then the lucky number will be -1.○ [5] => -1Implement a function getLuckyNumber(numbers) that takes an array of positive integers asinput and returns the lucky number from the array.Test Cases:● getLuckyNumber([2, 2, 3, 3]) => 2● getLuckyNumber([1, 2, 2, 3, 3, 3, 4]) => 3● getLuckyNumber([5]) => -1getLuckyNumber(numbers){// function implementation// return number whose value is equal to the occurrence of the number in the array// e.g [2, 2, 3, 3] => lucky number = 2// in case there are multiple lucky numbers…arrow_forwardCST-201 Project 0: Array Warm-Up The purpose of this assignment is to practice manipulating arrays. This assignment assesses your ability to: ▪Implement sequential and binary search algorithms for array structures. ▪Implement iterative sorting algorithms for array data. For this assignment, write a program that reads a text file and stores each word in an array. Write one of the iterative sorting algorithms to sort your data. Once the data is sorted, write a binary sort algorithm that, when given a string, returns either the index of the string or a -1 to indicate the string was not found in the array. Your program should allow the user to continually enter strings. An entry of 0 indicates the user is finished searching for strings. Start your program by reading strings from a file and populating a string array. Declare the array with a capacity for 10,000 strings. An input file is included with this assignment: ‘text.txt’. Next, write a method that implements either bubble sort,…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation; Author: Jenny's lectures CS/IT NET&JRF;https://www.youtube.com/watch?v=AT14lCXuMKI;License: Standard YouTube License, CC-BY
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License