9 comments

[ 3.5 ms ] story [ 31.4 ms ] thread
Thanks for linking this. Spent my weekend implementing a reverse string function in MIPS and it never struck me that I could do it recursive instead.
> Spent my weekend implementing a reverse string function in MIPS

There must be a story behind this.

That it took me a whole weekend (not really but it felt like it) or the fact that I did it? Homework :)
Quite interesting.

When playing with the B+ tree, I added about 30 values, including the same value about 3-4 times. Apparently, you cannot delete the last of those repeating values. Seems to be a bug.

No wonder the B+ trees are considered as one of the most complex of widely used data structures.

Thanks a lot for this, I feel like having a visual tool to learn/teach this kind of stuff is never a bad thing.
Credit to ex usf professor Galles! These visualizations are a huge help with a number of different and complicated algorithms/concepts!
the n=4-Queens visualisation is excellent.