Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
algorithms [2020/05/12 21:23]
paul
algorithms [2020/05/24 21:35] (current)
Line 331: Line 331:
 $$o(g(n)) = \{f(n)\ :\ for\ any\ positive\ constant\ c>0,\ there\ exists\ a\ constant\\\ $$o(g(n)) = \{f(n)\ :\ for\ any\ positive\ constant\ c>0,\ there\ exists\ a\ constant\\\
 n_0>0\ such\ that\ 0\leq f(n)\ < c*g(n)\ for\ all\ n \geq n_0\}.$$ n_0>0\ such\ that\ 0\leq f(n)\ < c*g(n)\ for\ all\ n \geq n_0\}.$$
 +
 +===== Backtracking =====
 +
 +Backtracking is an algorithm that looks at all possible solutions for a problem
 +and evaluates each one.
  
  • algorithms.1589318618.txt.gz
  • Last modified: 2020/05/12 21:23
  • by paul