Hello mnemonists, has anyone come up with a good strategy for memorizing Big-O notation for sorting algorithms and data structures?
What would this look like?
It’s this information:
I’ve memorized a good part of it a year or two ago. I’ll see if I can make a full set of example mnemonics for it and post it soon. Other people might have some ideas for it in the meantime.