13 - Algorithm Techiques

  • Dynamic Programming = Saving previously solved subproblems for recursive use.

  • Top-Down = Memorization = caching = lazy.

  • Down-Up = ??

  • Backtracking = Finding the best solution by stepping back on previous subsolutions to find a better one.

  • Greedy = Algorithm that uses heuristics to solve a probem by making at every level the local optimal choice in the hope of finding the global optimum.

  • Minimax, A wil hoogste, b wil laagst halen. Wat is de beste oplossing?

results matching ""

    No results matching ""