What is an Algorithm? Algorithm can be simply defined as the set of step by step instructions for solving a problem to achieve a result. These algorithms are very important when we use computers to solve problems, because computers are general purpose machines. Therefore, in order for a computer to be useful, we must give it a problem to solve and a technique for solving the problem. It is very important to give problem and solving techniques in the correct procedure, otherwise the computer become unable to work as an effective problem solving machine.
In order to convert the algorithm to a computer understandable, it must have certain characteristics. According to the formal definition given above, there are five important characteristics of an algorithm as stated below.
- well ordered
- has unambiguous operations
- has effectively computable operations
- produces a result
- halts in a finite amount of time
Types of Algorithms
There are different concepts we use to accomplish a task. Algorithms are also classified according to those concepts. While there are many types of algorithms, the most fundamental types of computer science algorithms are:
- Divide and conquer algorithms
- Randomized algorithms
- Brute force algorithms
- Recursive algorithms
- Greedy algorithms
- Backtracking algorithms
- Dynamic programming algorithms
Representation of Algorithms
Algorithms are used in every part of computer science. They form the field's backbone. In computer science, an algorithm gives the computer a specific set of instructions, which allows the computer to do everything. In the modern IT industry computer algorithms play a big role. It determines how social media works: which posts show up, which ads are seen, and so on. These decisions are all made by algorithms.
Comments
Post a Comment