International Baccalaureate IB Digital society
3.2.A Characteristics of an algorithm
Unambiguous, finite, well-defined inputs and outputs, feasible
3.2.B Components of an algorithm
Instructions, variables, conditionals, loops
3.2.C Ways of representing algorithms
Natural language, flow chart, code, programming languages
3.2.D Uses of algorithms
- Sorting, searching, filtering, prioritizing, classifying, associating, counting - Programming, software development and implementation - Machine learning, neural networks and in the creation of other algorithms