On the third day, during the sorting of old bookmarks, I caught the eye of
a flowchart with an STL container selection algorithm. “Why is it for containers, but not for standard algorithms? - I thought. “This needs to be fixed.” Thought - done. At first it was planned to draw something simple in a couple of hours, but later it turned out that the algorithms did not want to fit in a simple scheme. I got a little carried away, and after two evenings the scheme absorbed 84 algorithms, as well as some additional information. Under the cut you can see what happened in the end.
Version with wonderful pictures and large lettersBy clicking highres that did not fit into the storage store. In the storage itself , the size is on the verge of readability
The scheme corresponds to the realities of C ++ 14, but the differences from C ++ 11 are minimal (and listed
here ).
')
Corrections, additions, wishes
, holivars are strictly welcome.
UPD: On the advice of
Halt, the node with an ambiguous fork was reformulated.