FE: Last Algorithm Course You'll Need

Recursion

• maze solver might need a couple more tries in order to fully understand recursion

QuickSort

• the boundaries of qs are [lo, hi], which unusual for algorithms as most of them are [lo, hi[ excluding the upper boundary

LRU

The more complex data structures are compositions of the base ones, in order to mask flaws.

What's next?

Learn & study hard, because not everyone has the opportunity to have these workshops.

Metadata

Creator(s)

ThePrimeagen

Source

Recommended By

Reason

I've never really learned data structures & algorithms