1. ALGORITHMS
- Algorithm refers to a sequence of finite steps to solve a particular problem.
- Algorithms form the basis of computer programming and are used to solve problems ranging from simple sorting and searching to complex tasks such as artificial intelligence and machine learning
- Clear and Unambiguous
- Well-Defined Inputs : If an algorithm says to take inputs, it should be well-defined inputs. It may or may not take input.
- Well-Defined Outputs: The algorithm must clearly define what output will be yielded
- Finiteness: The algorithm must be finite, i.e. it should terminate after a finite time.
- Feasible: The algorithm must be simple, generic, and practical, such that it can be executed with the available resources
- Language (programming) Independent : it must be just plain instructions that can be implemented in any language, and yet the output will be the same, as expected.
Pseudocode
A Pseudocode is defined as a step-by-step description of an algorithm. Pseudocode does not use any programming language in its representation instead it uses the simple English language text as it is intended for human understanding rather than machine reading.
Pseudocode is the intermediate state between an idea and its implementation(code) in a high-level language.