Algorithm (Eng. “Algorithm”) is seen as an important topic in Computer Science. Because its use allows developers to build highly efficient and fault-free applications.
The word Algorithm refers to the 'Series of Steps' which are responsible for completing or performing a particular calculation or job. Next, we shall learn the definition of an algorithm in greater depth.
It was initially created to address mathematical difficulties. But now the word is largely linked with Computer Science. What is your algorithm in the next post? Will understand with an example.
Definition of 'algorithm'
An algorithm is a set of instructions that specifies the full method to solve a problem. Its major objective is to achieve the required output. It consists of several consecutive phases, only after the completion of which the output comes.
This may be understood using the example of preparing a cup of tea:
Step 1. Fill the pan with water
Step 2. Boil the water
Step 3. Put the tea leaves in the kettle
Step 4. Add grated ginger.
Step 5. Add one and a half teaspoons sugar
Step 6. Let the Tea Cook
Step 7. Strain the tea and pour it into the cup.
Just as to prepare a cup of tea, we have to execute the above-specified procedures in turn. In the same way, algorithms are developed to perform a process or task in programming, so that the desired result may be produced.
It is used in many different disciplines, the primary ones being computer science and mathematics. For example, the Search Algorithm is a step-by-step method that is used to obtain the stored web pages within the data structure.
Apart from this, Encryption Algorithm is a mathematical technique, by which a data or message is encoded such that it is difficult to read or comprehend. Using such methods, the data is kept out of reach of unauthorized individuals.
Who is the founder of an algorithm?
It has a lengthy history, although the exact word "algorithm" was first introduced in the 9th century. The Persian mathematician of the period, Abu Abdullah Muhammad ibn Musa Al-Khwarizmi is regarded as its creator. He is also regarded as the Father of Algebra.
In reality, Al-Khwarizmi was based on the work of Brahmagupta. Brahmagupta was a great Indian mathematician and astronomer. These two brilliant thinkers rose to fame when the word 'Algorism' was used to refer to Latin translations of their mathematical methods utilizing Hindi-Arabic numbers.
After this, the word 'Algorism' became the current "Algorithm" during the 18th century. In its modern form, it is utilized to tackle the issues of daily living separate from fields like Calculation, Data Processing, and Programming. So the word algorithm is that step-by-step process, which is created to solve a problem or job.
Properties of Algorithm
We cannot call any process an algorithm. Rather the algorithm should be useful i.e. it should solve the problem. For this to happen, an algorithm has several qualities. That is, it should meet the following requirements as described below:
1) Input: An algorithm should have well-defined inputs. Input is the data or information that we enter to create output.
2) Output: It should create output. That is, the correct answer to the problem should be offered.
3) Unambiguous: Every instruction or step written should be unambiguous. The input/output of each stage should also be clear.
4) Finiteness: It indicates, that the steps written in the algorithm must be stopped after a finite number of steps. Finished implies you should obtain the expected output and not continue in the processing loop.
5) Effectiveness: The algorithm should be practical, such that it is possible to execute the instructions with the available resources. That is, there should not be any unnecessary instructions in it that would render it ineffectual.
6) Language Independent: The directions should be written in basic language alone. Which may be implemented in any programming language.
Examples of Algorithms
Various methods are used to write the algorithm. Let us understand this with the simplest example.
Example 1– Calculating the average for 3 numbers.
Algorithm:
Step 1. Start
Step 2. Read 3 numbers A, B, C
Step 3. Calculate the average by the equation
Average = (A+B+C)/3
Step 4. Display Average
Step 5. StopExample 2– Find the largest among three different numbers entered by user.
Algorithm:
Step 1. Start Step 2. Declare variables a,b and c Step 3. Read variables a,b and c. Step 4. If a > b If a > c Display a is the largest number. Else Display c is the largest number. Else If b > c Display b is the largest number. Else Display c is the greatest number. Step 5. StopDoes it satisfy the criteria of being an algorithm: The inputs and outputs of the algorithm are properly specified. Each stage is described in a clear and accurate sense. There is a finite number of steps. That is the algorithm finishes after a while. The method provides an expected outcome. We obtain the proper outcome in the end. Types of Algorithms Although there are many varieties of it, the most fundamental types are given here.
Simple Recursive AlgorithmsBacktrackingDivide and Conquer Dynamic Programming Algorithm
Greedy Algorithms Branch and linked Method
Brute Force AlgorithmsRandom Algorithms
In short Writing a logical step-by-step method to solve a problem is termed an algorithm. In very simple words, an algorithm is like a plan to solve a problem. Generally, this phrase is used to solve mathematical and computational issues. It includes calculations, reasoning, and data processing. There are many ways to write an algorithm. Once we have the algorithm for a problem, then we may run it. It may be given in basic English language, Pseudocode, and Flowcharts. So hopefully, what is this post algorithm? By reading this, you must have become aware of it. If you have any questions or suggestion related to the topic, please let us know by commenting below. If you found the information useful, do not forget to share it.
0 Comments
If you have any doubts, please let me know