(a) Define the function bool findValue (std::stack & data, int value); that, using only a std::queue...

 

Transcribed Image Text:

(a) Define the function bool findValue (std::stack<int>& data, int value); that, using only a std::queue<int>, determines if a stack contains value and returns true if present and false otherwise. You may modify data within the function but must maintain the following: • The values stored in data must be preserved after the call. - You may modify data inside findValue but must restore the values and ordering before exiting. • You may not use any storage other than a single std::queue<int>. - You may not create 2 queues. - You may not create a copy of data. - You may use additional variables that have primitive types (bool,char,int,etc.). - You may not create any arrays. You may make the assumption that all values are unique that are stored in data. (b) Provide the runtime analysis for your function findValue. (a) Define the function bool findValue (std::stack<int>& data, int value); that, using only a std::queue<int>, determines if a stack contains value and returns true if present and false otherwise. You may modify data within the function but must maintain the following: • The values stored in data must be preserved after the call. - You may modify data inside findValue but must restore the values and ordering before exiting. • You may not use any storage other than a single std::queue<int>. - You may not create 2 queues. - You may not create a copy of data. - You may use additional variables that have primitive types (bool,char,int,etc.). - You may not create any arrays. You may make the assumption that all values are unique that are stored in data. (b) Provide the runtime analysis for your function findValue.

Answer rating: 100% (QA)

include include include using namespace std bool findValuestds... View the full answer