Implement the following function without using any additional data structure, and without sorting the input vectors. /* Given two vectors of integers, check if the two vectors contain same set of values: e.g., V1=[3,4,10,4,10,11] and V2=[3,3,4, 11, 10] stores same set int: {3, 4, 10, 11}. Note that duplicates are removed when considering set */ @param list1, list2: two vectors of integers @pre: list1, list2 have been initialized @post: return true if list1 and list2 stores same values (in same or different order); return false, if not. */ bool SameSet (const vector & list1, const vector & list2) { //for each value in list1, check if it appears in list2, if not, return false //for each value in list2, check if the value appears in list1, if not return false //return true }
Implement the following function without using any additional data structure, and without sorting the input
/* Given two vectors of integers, check if the two vectors contain same set of values: e.g., V1=[3,4,10,4,10,11] and V2=[3,3,4, 11, 10] stores same set int: {3, 4, 10, 11}. Note that duplicates are removed when considering set */
@param list1, list2: two vectors of integers
@pre: list1, list2 have been initialized
@post: return true if list1 and list2 stores same values (in
same or different order); return false, if not. */
bool SameSet (const vector<int> & list1, const vector<int> & list2)
{
//for each value in list1, check if it appears in list2, if not, return false
//for each value in list2, check if the value appears in list1, if not return false //return true
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
