STARTING OUT WITH C++FROM CONTROL STRU
18th Edition
ISBN: 9781323815458
Author: GADDIS
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 17.6, Problem 17.37CP
What value will be stored in v[0] after the following code executes?
sort(v.begin(). v.end());
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
this function c++ accept vector ,
replace this vector to array
void merge_sort_4(vector<int> lst,int start,int end){if (start < end){int quarter1 = (start + end) / 4;int quarter2 = (start + end) / 2;int quarter3 = (end - quarter1 - 1);
merge_sort_4(lst, start, quarter1);merge_sort_4(lst, quarter1 + 1, quarter2);merge_sort_4(lst, quarter2 + 1, quarter3);merge_sort_4(lst, quarter3 + 1, end);
merge4(lst, start, quarter1, quarter2, quarter3, end);}}void merge4(vector<int> lst,int start,int q1,int q2,int q3,int end){vector<int> first_q_list;for(int i=start;i<q1+1;i++)first_q_list.push_back(lst[i]);vector<int> sec_q_list;for(int i=q1+1;i<q2+1;i++)sec_q_list.push_back(lst[i]);vector<int> third_q_list;for(int i=q2+1;i<q3+1;i++)third_q_list.push_back(lst[i]);vector<int> last_q_list;for(int i=q1+1;i<end+1;i++)last_q_list.push_back(lst[i]);int…
Which of the following data structures store values in contiguous memory? Check all that apply .
Vector
Linked List
Dynamic Array
Map
Array
Part A:Implement binary search algorithm as a template function.
Part B:Given a vector of size S and a number N. Write a function that calculates if there isany pair of numbers in the vector whose sum is equal to N?
Hint: you can use the binary search function you implemented in part A.
Notes:You must use iterators in your implementation.
Input Format:The input consists of 2 lines. The first line contains 2 numbers, S and N. The secondline contains S numbers which represent the contents of the vector.
Input:3 53 1 2
Output:YES
Chapter 17 Solutions
STARTING OUT WITH C++FROM CONTROL STRU
Ch. 17.2 - Prob. 17.1CPCh. 17.2 - Prob. 17.2CPCh. 17.2 - Prob. 17.3CPCh. 17.2 - Suppose you are writing a program that uses the...Ch. 17.2 - Prob. 17.5CPCh. 17.2 - Prob. 17.6CPCh. 17.2 - What does a containers begin() and end() member...Ch. 17.2 - Prob. 17.8CPCh. 17.2 - Prob. 17.9CPCh. 17.2 - Prob. 17.10CP
Ch. 17.3 - Write a statement that defines an empty vector...Ch. 17.3 - Prob. 17.12CPCh. 17.3 - Prob. 17.13CPCh. 17.3 - Write a statement that defines a vector object...Ch. 17.3 - What happens when you use an invalid index with...Ch. 17.3 - Prob. 17.16CPCh. 17.3 - If your program will be added a lot of objects to...Ch. 17.3 - Prob. 17.18CPCh. 17.3 - Prob. 17.19CPCh. 17.4 - Prob. 17.20CPCh. 17.4 - Write a statement that defines a nap named myMap....Ch. 17.4 - Prob. 17.22CPCh. 17.4 - Prob. 17.23CPCh. 17.4 - Prob. 17.24CPCh. 17.4 - Prob. 17.25CPCh. 17.4 - Prob. 17.26CPCh. 17.4 - Prob. 17.27CPCh. 17.5 - What are two differences between a set and a...Ch. 17.5 - Write a statement that defines an empty set object...Ch. 17.5 - Prob. 17.30CPCh. 17.5 - Prob. 17.31CPCh. 17.5 - Prob. 17.32CPCh. 17.5 - If you store objects of a class that you have...Ch. 17.5 - Prob. 17.34CPCh. 17.5 - Prob. 17.35CPCh. 17.6 - Prob. 17.36CPCh. 17.6 - What value will be stored in v[0] after the...Ch. 17.6 - Prob. 17.38CPCh. 17.6 - Prob. 17.39CPCh. 17.6 - Prob. 17.40CPCh. 17.6 - Prob. 17.41CPCh. 17.6 - Prob. 17.42CPCh. 17.7 - Prob. 17.43CPCh. 17.7 - Which operator must be overloaded in a class...Ch. 17.7 - Prob. 17.45CPCh. 17.7 - What is a predicate?Ch. 17.7 - Prob. 17.47CPCh. 17.7 - Prob. 17.48CPCh. 17.7 - Prob. 17.49CPCh. 17 - Prob. 1RQECh. 17 - Prob. 2RQECh. 17 - If you want to store objects of a class that you...Ch. 17 - If you want to store objects of a class that you...Ch. 17 - Prob. 5RQECh. 17 - Prob. 6RQECh. 17 - Prob. 7RQECh. 17 - If you want to store objects of a class that you...Ch. 17 - Prob. 9RQECh. 17 - Prob. 10RQECh. 17 - How does the behavior of the equal_range() member...Ch. 17 - Prob. 12RQECh. 17 - When using one of the STL algorithm function...Ch. 17 - You have written a class, and you plan to store...Ch. 17 - Prob. 15RQECh. 17 - Prob. 16RQECh. 17 - Prob. 17RQECh. 17 - Prob. 18RQECh. 17 - Prob. 19RQECh. 17 - Prob. 20RQECh. 17 - Prob. 21RQECh. 17 - A(n) ___________ container stores its data in a...Ch. 17 - _____________ are pointer-like objects used to...Ch. 17 - Prob. 24RQECh. 17 - Prob. 25RQECh. 17 - The _____ class is an associative container that...Ch. 17 - Prob. 27RQECh. 17 - Prob. 28RQECh. 17 - A _______ object is an object that can be called,...Ch. 17 - A _________ is a function or function object that...Ch. 17 - A ____________ is a predicate that takes one...Ch. 17 - A __________ is a predicate that takes two...Ch. 17 - A __________ is a compact way of creating a...Ch. 17 - T F The array class is a fixed-size container.Ch. 17 - T F The vector class is a fixed-size container.Ch. 17 - T F You use the operator to dereference an...Ch. 17 - T F You can use the ++ operator to increment an...Ch. 17 - Prob. 38RQECh. 17 - Prob. 39RQECh. 17 - T F You do not have to declare the size of a...Ch. 17 - T F A vector uses an array internally to store its...Ch. 17 - Prob. 42RQECh. 17 - T F You can store duplicate keys in a map...Ch. 17 - T F The multimap classs erase() member function...Ch. 17 - Prob. 45RQECh. 17 - Prob. 46RQECh. 17 - Prob. 47RQECh. 17 - Prob. 48RQECh. 17 - T F If two iterators denote a range of elements...Ch. 17 - T F You must sort a range of elements before...Ch. 17 - T F Any class that will be used to create function...Ch. 17 - T F Writing a lambda expression usually requires...Ch. 17 - T F You can assign a lambda expression to a...Ch. 17 - Prob. 54RQECh. 17 - Write a statement that defines an iterator that...Ch. 17 - Prob. 56RQECh. 17 - The following statement defines a vector of ints...Ch. 17 - Prob. 58RQECh. 17 - Prob. 59RQECh. 17 - The following code defines a vector and an...Ch. 17 - The following statement defines a vector of ints...Ch. 17 - Prob. 62RQECh. 17 - Prob. 63RQECh. 17 - Prob. 64RQECh. 17 - Look at the following vector definition: vectorint...Ch. 17 - Write a declaration for a class named Display. The...Ch. 17 - Write code that docs the following: Uses a lambda...Ch. 17 - // This code has an error. arrayint, 5 a; a[5] =...Ch. 17 - // This code has an error. vectorstring strv =...Ch. 17 - // This code has an error. vectorint numbers(10);...Ch. 17 - // This code has an error. vectorint numbers ={1,...Ch. 17 - Prob. 72RQECh. 17 - Prob. 73RQECh. 17 - // This code has an error. vectorint v = {6, 5, 4,...Ch. 17 - // This code has an error. auto sum = ()[int a,...Ch. 17 - Unique Words Write a program that opens a...Ch. 17 - Course Information Write a program that creates a...Ch. 17 - Prob. 3PCCh. 17 - File Encryption and Decryption Write a program...Ch. 17 - Prob. 5PCCh. 17 - Prob. 6PCCh. 17 - Prob. 7PCCh. 17 - Prob. 8PC
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Many treadmills output the speed of the treadmill in miles per hour (mph) on the console, but most runners thin...
Problem Solving with C++ (9th Edition)
Run the hello, world program on your system. Experiment with leaving out parts of the program, to see what erro...
C Programming Language
Prime Number List This exercise assumes you have already designed the isPrime function in Programming Exercise ...
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Write a version of the inner product procedure described in Problem 5.13 that uses 6 1 loop unrolling. For x86...
Computer Systems: A Programmer's Perspective (3rd Edition)
Distance Traveled The distance a vehicle travels can be calculated as follows: Distance=SpeedTime For example, ...
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
If class X declares function f as a friend, does function f become a member of class X?
Starting Out with C++ from Control Structures to Objects (8th 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
- Implement binary search algorithm as a template function.Part B: Given a vector of size S and a number N. Write a function that calculates if there is any pair of numbers in the vector whose sum is equal to N?Hint: you can use the binary search function you implemented in part A.Notes:You must use iterators in your implementation.Input Format: The input consists of 2 lines. The first line contains 2 numbers, S and N. The second line contains S numbers which represent the contents of the vector.arrow_forwardCreate two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the composite numbers from the merged array A calling a function bypointer. You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.arrow_forwardSuppose that two arraysx1,x2,…,xnandy1,y2,…,yn.( Need only handwritten solution please otherwise downvote).arrow_forward
- Can you please rewrite replacing the vector<vector<int>> all_line_numbers; that was removed and remove a difference vector that will preform a parallel sort please. Thank you Rewrite the program without the unnecessary vector. 1) The program declares the following vectors, vector<string> all_words;vector<int> all_word_counts;vector<vector<int>> all_line_numbers; //do not remove this one One of the vectors is unnecessary. 2) Sort the 2 or 3 parallel vectors in ascending order of the words or the number of times the words appear in the file. #include <cassert> #include <iostream> #include <fstream> #include <iomanip> #include <iostream> #include <string> #include <vector> #include <cmath> #include <algorithm> using namespace std; const string empty_string = ""; vector<string> getWords(const string& text); int findWord(const vector<string>& words, const string& word); int…arrow_forwardIn Quick Sort, the function Partition is used to arranged the values into the S1 set and S2 set based on the pivot value. Given the following array, what is the content of the array after the function Partition finished the 1st pass assuming the pivot value is 40? array: 44 12 50 3 40 23 Question 4 options: 3 12 23 40 44 50 12 3 23 40 44 50 40 12 3 50 44 23 23 12 3 40 44 50arrow_forwardAdd each element in origList with the corresponding value in offsetAmount. Print each sum followed by a space. Ex: If origList = {40, 50, 60, 70} and offsetAmount = {5, 7, 3, 0}, print: 45 57 63 70 #include <iostream>#include <vector>using namespace std; int main() {const int NUM_VALS = 4;vector<int> origList(NUM_VALS);vector<int> offsetAmount(NUM_VALS);unsigned int i; for (i = 0; i < origList.size(); ++i) {cin >> origList.at(i);} for (i = 0; i < offsetAmount.size(); ++i) {cin >> offsetAmount.at(i);} cout << endl; return 0;} Please help me with this problem using c++.arrow_forward
- Rewrite the Binary search function in the textbook to use a generic type for the array elements. Test the function with arrays of int, double, and string values. *When using test arrays make sure elements are stored in ascending sorted order*arrow_forwardModify the existing vector's contents, by erasing the element at index 1 (initially 200), then inserting 100 and 102 in the shown locations. Use Vector ADT's erase() and insert() only, and remember that the first argument of those functions is special, involving an iterator and not just an integer. Sample output of below program with input 33 200 10: #include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) {unsigned int i; for (i = 0; i < numsList.size(); ++i) {cout << numsList.at(i) << " ";}cout << endl;} int main() {vector<int> numsList;int userInput;int i; for (i = 0; i < 3; ++i) {cin >> userInput;numsList.push_back(userInput);} /* Your solution goes here */ PrintVectors(numsList); return 0;} Please help me with this problem using c++.arrow_forwardWrite code for determining the index of a value in an OrderedVector. Be aware that if the value is not in the Vector, the routine returns the ideal location to insert the value. This may be a location that is outside the Vector(use java)arrow_forward
- void getVectorSize(int& size); void readData(vector<Highscore>& scores); void sortData(vector<Highscore>& scores); vector<Highscore>::iterator findLocationOfLargest( const vector<Highscore>::iterator startingLocation, const vector<Highscore>::iterator endingLocation); void displayData(const vector<Highscore>& scores); The size parameter from the given code won't be needed now, since a vector knows its own size. Notice that the findLocationOfLargest() function does not need the vector itself as a parameter, since you can access the vector using the provided iterator parameters. The name field in the struct must still be a c-string The focus of this assignment is to use iterators. You must use iterators wherever possible to access the vector. As a result, you must not use square brackets, the push_back() function, the at() function, etc. Also, the word "index" shouldn't appear in your code anywhere. You won't get full credit if…arrow_forwardIn C program language, You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.arrow_forwardplease convert the code to C language //C++ program to check if two arrays //are equal or not #include <bits/stdc++.h>using namespace std; bool similar_array(vector<int> arr1, vector<int> arr2){ //create teo different hash table where for each key //the hash function is h(arr[i])=arr[i] //we will use stl map as hash table and //will keep frequency stored //so say two keys arr[0] and arr[5] are mapping to //the same location, then the location will have value 2 //instead of the keys itself //if two hash tables are exactly same then //we can say that our arrays are similar map<int, int> hash1; map<int, int> hash2; //for each number for (int i = 0, j = 0; i < arr1.size(); i++, j++) { hash1[arr1[i]]++; hash2[arr2[i]]++; } //now check whether hash tables are exactly same or not for (auto it = hash1.begin(), ij = hash2.begin(); it != hash1.end() && ij != hash2.end(); it++, ij++) {…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
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
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