KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I am practicing a question on array in which I have to find unique elements. Now for this my logic is to find the max element in the array and define the bitset for that. But problem is bitset needs a constant value so how to overcome this, below are some of my question on this: a) Can I, by any chance, define the bitset with a variable size? b) If not, then what is the best approach to use vector<bool> or vector<char> ? c) I know boost has a dynamic bitset but as I am doing this for learning I want to know of alternate approaches.
Tags (comma-separated)
Save Edits
Cancel