4 ms·
I've got a Data Structures and Algorithms final tomorrow, likely including a few 2-4 Tree problems... I will be forever grateful that we at least don't have to
by mondobe 3y ago
I've got a Data Structures and Algorithms final tomorrow, likely including a few 2-4 Tree problems... I will be forever grateful that we at least don't have to implement them, just simulate them.
- airstrike 3y agojust curious.. what language is it being taught in?
- widforss 3y agoWhen I did it it wasn't in any language. We just drawed the evolution of the trees on paper. I got my degree in 2021.
- vincent-manis 3y agoMany years ago I taught a Data Structures course section where all the students were B+s or As. I gave them an assignment to do in-memory B-tree insertion and search. They mostly succeeded, though I had more than one paper handed in that was titled “The Assignment From Hell”.
- tomcam 3y ago> all the students were B+s or As Or maybe > all the students were B+s or B*s I'll see myself out now
- vincent-manis 3y agoYou win!
- airstrike 3y ago> “The Assignment From Hell” LOL! I love that That one for me must have been pricing reverse exchangeable notes in R
- tomcam 3y agoWhat? They're fun to implement
- dgreensp 3y agoIt really isn't so big a deal; the author of this post is spreading fear, in a way. For example, saying that you need "real world data" to catch "edge cases" like this... no, proper unit tests will do just fine. Also, the problem of splitting different-sized keys in the way the author first tries to do does not strike me as a mistake anyone would fall into or that is hard to get out of.