Algorithms
Definition
- The set of rules to be followed in calculations is an algorithm,
- Problem-solving operation is an algorithm,
- These set of rules or instructions solve a class of problems
Terms related to algorithms
- Every algorithm must satisfy the following properties,
- These properties can measure the effectiveness of the software,
- The algorithm may associate with computational processes,
- Input: An algorithm should have a specified set of input,
- Output: An algorithm must produce output as a result.,
- Finiteness: An algorithm must terminate at a finite number of iteration,
- Definiteness: All instruction set must be precisely defined,
- Effectiveness: Each step of algorithms should complete an infinite set of times
Big o notation
- The complexity of an algorithm can be measured in Big-O,
- Which mean a number of operation performed by the algorithms to return a result,
- Big-O notation represents the upper limits of an algorithm costs, O(n),
- O(n): n is the sie of the input,
- Bi-O is an upper bound,
- Big-Ω is lower bound