⚙️ Algorithm
= processing instructions for manipulating 🗂 Data structures (built of the following components: 🗂 Algorithm classifcation)
😡 An algorithm MUST be:
- finite (static or dynamic end)
- executable (by “processor”)
- unambiguous
- correct (solves problem)
- complete (all cases work)
👑 An algorithm CAN be:
- inefficient ↔︎ efficient (effort required)
- ineffective ↔︎ effective (quality produced)
- → ᦛ Levels of complexity