gibsjose / cpp-cheat-sheet Goto Github PK

std::map does not have a method to find by value, but rather only by key.

HI,
Can you please assign me this task for hacktoberfest?

Under 1.10 Heap std:: priority queue
The definition of min-heap is provided as "A min-heap is structured with the root node as the smallest and each child subsequently smaller than its parent" which is incorrect because the root of tree would be the smallest element and its children would have a higher value than that.
Similarly, the definition of max-heap also should be modified to "A max heap is structured with the root node as the largest and each child subsequently smaller than its parent".

The data structures and algorithms sheet is pretty much filled out, but the C++ sheet is lacking...

There are gifs which are not working.

Example:

Hello,

First, thanks for the great resource! I just wanted to point out that std::set does not contain method remove as it is indicated in your code example. Instead std::set::erase should be used.

Thanks again,
tamaroth

On the following section for map: https://github.com/gibsjose/cpp-cheat-sheet/blob/master/Data%20Structures%20and%20Algorithms.md#15-map-stdmap-and-stdunordered_map

//iterator
for(std::map<int>::iterator it = m.begin(); it != m.end(); it++) {

I believe it should be

//iterator
for(std::map<std::string, std::string>::iterator it = m.begin(); it != m.end(); it++) {

It is hard to see clearly the curves on the current "Big-O Complexity" Chart and will be better if we could add line markers on it.

Knapsack and Travelling sales man algorithms missing in the data structures and algorithms cheat sheet