Comments by "MrAbrazildo" (@MrAbrazildo) on "Kantan Coding" channel.

To me, all animal would be objects of (not derived classes from) Animal class, containing the greet string. So all of them can be placed on a container, and algorithm may be applied to them. Interface is BS.
1
0:58, this is a common mistake, even among experts. Because we don't like to rely on the compiler ability to save us from a "performance mistake". This is a simple 1, probably compiler does the right job of undoing it, whenever the initialization was unnecessary. But it's hard to put this practice on people's mind, on this niche. It's a cultural issue. 1:20, in C++ it's recommended to put: assert (number.length). It ends up not taking performance, because all those asserts might be ordered to not be executed, in 1 line of code - after debugging. 1:40, an easy to fix typo, immediately catched by the compiler, I wouldn't even take it as a worth mentioning error. 2:10, there's another problem: floating pointing should not be compared by exact values. 3:30, this for config. is so much more often than others, that I even wrote a macro for it. 0:01, this f() should return a bool: return average - expected < abs (max_imprecision); In C++ this would be result in bool. Or if a message should be send: return "average is " (average - expected < abs (max_imprecision) ? "correct" : "incorrect"); I don't remember if this compiles.
1
0:55, on compiler options, try to pass the flag -O2 or -O3: it'll do that simplification for you. 3:15, the fastest approach here would be to have an enum like integers. This would dismiss any search. ie. C: enum completedStatuses { REFUND=0, CAPTURED, FAILED, CANCELED, MAX_STATUSES }; // All integers. if (labs (status) < completedStatuses.MAX_STATUSES) { // labs just to grant that status is not negative. // do some logic for completed orders... }
1
 @naehalmulazim Why? map[string] is crazily slow.
1
2:40, these cases should be put in array: 15% faster and the code doesn't grows downside too much. C++ example: const auto Animals = { "dog", "cat", /**/ "last1" }; // All cases. const auto ChosenAnimalPtr = strstr (Animals.data(), tolower (animalType)); // Returns Pointer of the match, not case sensitive. // TODO: check for nonmatch (default case). const auto ChosenAnimalIndex = std::distance (Animals.data(), ChosenAnimalPtr); // That distance from the beginning is the index. ++animalCounts[ChosenAnimalIndex]; 3:53, the previous comments were given a C lesson. I still argue for concise code. So: while (*dest++ = *src++); // Copies string src to dest.
1