Question 1 Write a function that removes duplicates from a vector of integers using the following idea: for each element of the vector, look at all the elements after it, and remove any element that is equal (hint: you can remove an element at position i either by copying the last element into it, then popping back, or by investigating the use of the vector erase () function). Incorporate the function in a program that creates a vector containing 10 randomly generated integers ranging between 1 and 20, then removes the duplicates: int main () { } vector list = create (); print (list); remove_dup (list); print (list);

Question 1 Write a function that removes duplicates from a vector of integers using the following idea: for each element of the vector, look at all the elements after it, and remove any element that is equal (hint: you can remove an element at position i either by copying the last element into it, then popping back, or by investigating the use of the vector erase () function). Incorporate the function in a program that creates a vector containing 10 randomly generated integers ranging between 1 and 20, then removes the duplicates: int main () { } vector list = create (); print (list); remove_dup (list); print (list);

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Code in C. Solve the code below. Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq". int busca_seq(int vetor[], int n, int b) { //your code } My Code #include<stdio.h> int busca_seq(int vetor[], int n, int b) { int i; for(i = 0; i < n; i++){ if(vetor[i] == b) return (i+1); } { int vet[5],n = 5,b,x; vet[0] = 1; vet[1] = 2; vet[2] = 3; vet[3] = 4; vet[4] = 5; scanf("%d",&b); x = busca_seq(vet,n,b); printf("%d",x); return 0; } }
In c++ please Write the RemoveEvens() function, which receives a vector of integers as a parameter and returns a new vector of integers containing only the odd numbers from the original vector. The main program outputs values of the returned vector. Hint: If the original vector has even numbers, then the new vector will be smaller in length than the original vector and should have no blank element. Ex: If the vector passed to the RemoveEvens() function is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the function returns and the program output is: [1, 3, 5, 7, 9] Ex: If the vector passed to the RemoveEvens() function is [1, 9, 3], hen the function returns and the program output is: [1, 9, 3] #include <iostream>#include <vector>using namespace std; vector<int> RemoveEvens(vector<int> nums) { /* Type your code here */} int main() { vector<int> input(9); input.at(0) = 1; input.at(1) = 2; input.at(2) = 3; input.at(3) = 4; input.at(4) = 5;…
Write a function named cumulative that accepts as a parameter a reference to a vectorof integers, and modifies it so that each element contains the cumulative sum of the elements up through that index. For example, if the vector passed contains {1, 1, 2, 3, 5}, your function should modify it to store {1, 2, 4, 7, 12}.
Modify your bottom-up function DPchange to return not only the best number of coins but also the corresponding combination of denominations as a vector. Do this by creating a new function DPChange_bt that is largely the same as DPChange but declares an array coinsUsed that keeps track of the coin on the best path to a given entry M (between 1 and ?+1). DPChange_bt should return both bestNumCoins and coinsUsed.
in c++ Write a function named “getLowest” that accepts a vector of pointers to Student objects. It will go through the list and return pointers to the Student or GradStudent with the lowest student ID and GPA. Please note that the vector contains pointers to either Student or GradStudent objects. Please show that you have tested with a vector of pointers of mixed Student and GradStudent objects (in the same vector) For example, if these students and grad students are in the list Student(2000, "John Smith", 4.0) GradStudent(3000,"Nancy Brown", 3.5, 2021) ; Student(1000, "Bob Johnson", 3.0) ; GradStudent(4000, "Tim Jackson", 2.0, 2020)) ; It will return pointers to these two objects: Lowest ID: ID(1000) NAME(Bob Johnson) GPA(3.00) Lowest GPA: ID(4000) NAME(Tim Jackson) GPA(2.00) GRADUATION-YEAR(2020)
You may insert an element into an arbitrary position inside a vector using an iterator. Write a function, insert(vector, value) which inserts value into its sorted position inside the vector. The function returns the vector after it is modified. #include <vector>using namespace std; vector<int>& insert(vector<int>& v, int value){ ................ return v; }
Finding the Minimum of a Vector Write a function to return the index of the minimum value in a vector, or -1 if the vector doesn't have any elements. In this problem you will implement the IndexOfMinimumElement function in minimum.cc and then call that function from main.cc. You do not need to edit minimum.h. Index of minimum value with std::vector Complete IndexOfMinimumElement in minimum.cc. This function takes a std::vector containing doubles as input and should return the index of the smallest value in the vector, or -1 if there are no elements. Complete main.cc Your main function asks the user how many elements they want, construct a vector, then prompts the user for each element and fills in the vector with values. Your only task in main is to call the IndexOfMinimumElement function declared in minimum.h, and print out the minimum element's index. Here's an example of how this might look: How many elements? 3 Element 0: 7 Element 1: -4 Element 2: 2 The minimum value in your…
Complete the function that return the sum of all elements in the vector passed as input.
Write a function named addStars that accepts as a parameter a reference to a vector of strings, and modifies the vector by placing a "*" element between elements, as well as at the start and end of the vector. For example, if the vector v contains {"the", "quick", "brown", "fox"}, the call of addStars(v); should modify it to store {"*", "the", "*", "quick", "*", "brown", "*", "fox", "*"}.
You may insert an element into an arbitrary position inside a vector using an iterator. Write a function, insert(vector, position, value) which inserts value into position inside the vector and returns true. If position is out of range, then return false #include <vector>using namespace std; bool insert(vector<int>& v, size_t pos, int value){ ........ }
ASSIGNMENT: Working with Vectors Write a menu-driven program that will allow the user to run any of the following questions. Please put the functions headers in h file and the functions definitions in a .cpp file. 1. Write C++ code for a loop that simultaneously computes both the maximum and minimum element in a given vector. 2. Write a function double scalar_product(vector a, vector b) that computes the scalar product of two vectors. The scalar product of two vectors A[al, a2, a3) and B(bl, b2, b3} is another vector C given by C{c1, c2, c3} where cl = al * b1, c2 = a2 + b2, c3 = a3 + b3. 3. Write a function that computes the alternating sum of all elements in a vector. For example, if alternatingSum() is called with a vector containing 149 16 9 7 4 9 11 then it computes 1-4+9-16+9-7+4-9+11=-2 4. Write a procedure reverse that reverses the sequence of elements in a vector. For example, if reverse is called with a vector containing 1 49 16 9 7 4 9 11 then the vector is changed 11 9 4 7…
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.