Algorithms are instructions to complete any type of tasks, from coding to cooking.
Algorithms can be written using sequential, selection, and repetitive statements.
Intractable algorithms cannot run in a reasonable amount of time.
Undecidable problems have no solution for all instances.
Heuristics can sometimes be used to find a solution that is close enough.
Algorithms can be analyzed for clarify, correctness, and efficiency.
