The claim, and I don't think it's substantiated, is that in the real world searches will often be values outside the extremes. Similar but perhaps less offensive is the tradeoff between two extremes (40:45) which assumes both equally likely. If we search for integers maybe negative extreme is way less likely than positive ones in the real world? Anyways, you should believe Andrei not a random stranger. I enjoyed the presentation.
If you search the back catalog of presentations, you will find a few that answer this. I suggest the Keynotes by Stroustrup for an overview of the language's audience and strengths. A short answer (relative to C and ASM): higher level abstractions allow writing and maintaining larger bodies of code with less effort and far fewer errors. And compared to ASM, there is portability of course!
The structure of this talk is actually pretty bad. You need to deliver the solution up front since that's what you title or re-title the talk to be a history binary sort or a review of binary sort. (Of course, I could be wrong)
This guy is not only genius, but also very funny, his talks are the best!
The claim, and I don't think it's substantiated, is that in the real world searches will often be values outside the extremes. Similar but perhaps less offensive is the tradeoff between two extremes (40:45) which assumes both equally likely. If we search for integers maybe negative extreme is way less likely than positive ones in the real world? Anyways, you should believe Andrei not a random stranger. I enjoyed the presentation.
clickbait title
AI is the new crypto!
I'm 46 minutes in and no mention of AI yet.
ll = communist, rl = ? centrist? => sliding overton window algorithm
Why use C++ There is assembler and C...
There are other languages as well, why mention only these too?
Why shouldn't the guy who is a legend in a C++ community use C++?
If you search the back catalog of presentations, you will find a few that answer this. I suggest the Keynotes by Stroustrup for an overview of the language's audience and strengths.
A short answer (relative to C and ASM): higher level abstractions allow writing and maintaining larger bodies of code with less effort and far fewer errors. And compared to ASM, there is portability of course!
Why do you think Knuth presents his algorithms in (self-invented) ASM, and pseudocode? Should he do have done it in Basic? @@VFPn96kQT
For RAII and templates.
The structure of this talk is actually pretty bad. You need to deliver the solution up front since that's what you title or re-title the talk to be a history binary sort or a review of binary sort. (Of course, I could be wrong)
Awful. No drawings of what he was talking about, and the tiny, unreadable letters are useless.