What is an Algorithm? its Important Categories and Characteristics
IMPORTANT: In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used for calculation, data processing, and automated reasoning. More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
While defining an algorithm step are written in a human understandable language and independent of any programming language. We can implement it in any programming language of our choice. From the data structure point of view
Following are some important Categories and Characteristics of algorithms
An algorithm is a detailed series of instructions for carrying out an operation or solving a problem. In a non-technical approach, we use algorithms in everyday tasks, such as a recipe to bake a cake or a do-it-yourself handbook.
Technically, computers use algorithms to list the detailed instructions for carrying out an operation. For example, to compute an employee’s paycheck, the computer uses an algorithm. To accomplish this task, appropriate data must be entered into the system. In terms of efficiency, various algorithms are able to accomplish operations or problem solving easily and quickly.
While defining an algorithm step are written in a human understandable language and independent of any programming language. We can implement it in any programming language of our choice. From the data structure point of view
Following are some important Categories and Characteristics of algorithms
Algorithm types we will consider include:
- An Algorithm to Sort items in a certain order (Either Ascending/Descending order).
- An Algorithm to Searches an item in a data structure.
- An Algorithm to Insert item in a data structure.
- An Algorithm to Update an existing item in a data structure.
- An Algorithm to Delete an existing item from a data structure.
- Simple recursive algorithms.
- Backtracking algorithms.
- Divide and conquer algorithms.
- Dynamic programming algorithms.
- Greedy algorithms.
- Branch and bound algorithms.
- Brute force algorithms.
- Randomized Algorithms.
Algorithm and its Characteristics:
The characteristics of a good algorithm are: Precision – the steps are precisely stated(defined). Uniqueness – the results of each step are uniquely defined and only depend on the input and the result of the preceding steps. Finiteness – the algorithm stops after a finite number of instructions are executed.
- Finiteness: An algorithm must always terminate after a finite number of steps.
- Definiteness: Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case.
- Input: An algorithm has zero or more inputs, i.e, quantities which are given to it initially before the algorithm begins.
- Output: An algorithm has one or more outputs i.e, quantities which have a specified relation to the inputs.
- Effectiveness: An algorithm is also generally expected to be effective. This means that all of the operations to be performed in the algorithm must be sufficiently basic that they can in principle be done exactly and in a finite length of time.
- Unambiguous: Algorithm should be clear and Unambiguous. Each of its Steps and their inputs/outputs should be clear and must lead to only one meaning
- Feasibility: Should be feasible with the Available Resources.
