- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 3
- Posts with Downvotes
- 3
- Downvoting Members
- 3
8 Posted Topics
Hey guys. This is really frustrating because it seems easy but I can't seem to find the correct function to remove this element of my string. [code] void set::display() const // pre : none // post : displays the elements of this set enclosed in braces and // separated by …
Hey guys. I'm having trouble getting the largest/smallest value of an element in a set I created from my class. It has to return the largest/smallest element of specific elements that are set to true in my <bool> vector. Example: [code] int set::getLargest() const { if ( !setlist.empty() ) { …
Hey guys. I need help on how to set a specific element that I insert into my vector of bool type :S [code] set::set() { cardinality = 0; setlist.resize(DEFAULTSIZE, false); } void set::insert(int x) { if (x >= 0 && x <= DEFAULTSIZE) { setlist.insert(setlist.begin(), 1, x); x = true; …
Hey guys. I need help with these questions please :( 1. Write a function that takes as a parameter a queue of integers and returns a copy of the queue with all the elements stored in reverse order. Use a stack as a helper data structure. [code]queue<int> reverseQueue(queue<int> q) // …
Hey guys. I need help on how to find the largest/smallest position in a set of vectors. Because I'm using vector<bool> type.. the elements in my vector are either 0's or 1's.. therefore what I need to do: 1. find out what position they are at (all the 1 values) …
Hey guys. These functions are not working together correctly because of the true/false statements. Can someone please show me how I can fix the empty() function to work simultaneously with my other function provided? :S My getSmallest() function will not return the value due to the empty() function.. [code] bool …
[code]set::set() { cardinality = 0; setlist.resize(DEFAULTSIZE, false); } set::set(int n) { cardinality = 0; setlist.resize(50000, false); } bool set::empty() const { if ( setlist.empty() ) { return true; } return false; } void set::insert(int x) { if (x >= 0 && x <= DEFAULTSIZE) { setlist.insert(setlist.end(), 1, x); cardinality++; } …
[CODE] if (user_input == 1) { dict.open("dict.txt"); cout << "Enter word "; cin >> word_check; toLower(word_check); vector<string> lines; string line; if (dict.is_open()) // if the dictionary is open { while (getline(dict,line)) { lines.push_back(line); } if (binarySearch(lines, lines.size(), word_check) != -1) { cout << word_check << " is in dictionary" << …
The End.
scantraXx-