Importance Of Algorithm Analysis

 

Topic : Blog- Importance Of Algorithm Analysis

Class: FYMCA

 

Members: 

36. Onkar Kulkarni.

26. Kunal Ingale.

31. Rutik kadam .

25. Shantanu Inamdar.

                                    What is an Algorithm?

One day, making a decision to prepare dinner dinner your self a cake for a change, however you're uncertain of the way to do it. That is while making a decision to google the stairs to make a cake and also you find ’n’ variety of steps for one-of-a-kind forms of cakes. All the ones one-of-a-kind little by little process to make a cake may be referred to as as an set of rules. In laptop technology global the little by little process this is accompanied to clear up a particular undertaking or a problem (e.g. sorting an unsorted array) is referred to as an set of rules. is called an algorithm.

                                      Fig.no:1 Analysis Of Algorithms

Algorithm evaluation is an crucial a part of computational complexity theory, which presents theoretical estimation for the desired sources of an set of rules to clear up a particular computational problem. Most algorithms are designed to paintings with inputs of arbitrary period. Analysis of algorithms is the willpower of the quantity of time and area sources required to execute it.

Usually, the performance or walking time of an set of rules is said as a feature touching on the enter period to the variety of steps, referred to as time complexity, or quantity of memory, referred to as area complexity.

                                                The Need for Analysis:

Considering an algorithm for a specific problem, we can start to develop pattern recognition so that similar problems can be solved with this algorithm.

The algorithms are often very different from each other, although the purpose of these algorithms is the same. For example, we know that a set of numbers can be sorted using various algorithms. The number of comparisons made by one algorithm may vary depending on other factors. Thus, these algorithms can have different timing. At the same time, we need to calculate the memory space required by each algorithm.

 However, the main concern of analysis of algorithms is the required time or performance. Generally, we perform the following types of analysis −

• Worst-case − The maximum number of steps taken on any instance of size a.

• Best-case − The minimum number of steps taken on any instance of size a.

• Average case − An average number of steps taken on any instance of size a.

• Amortized − A sequence of operations applied to the input of size a averaged over time..

                    

                            Importance of Algorithm and it’s analysis :

 Making these calculations is important in order to use them effectively. If you are working on a significant project, you may need to estimate how long it will take. Without a understanding of runtime examination, this gauge will be less precise. Besides, it is important to understand the subtleties of the calculations included so you will have the ability to anticipate what will happen if the product doesn't work quickly, or if it produces undesirable outcomes. 

                                            Fig.no:2 Algorithm Analysis

It's natural to run into problems from time to time that have not been addressed recently. In these cases, you will need to come up with another calculation, or use an old calculation in a different way. If you are familiar with calculations related to this situation, you are more likely to find an effective solution. Another issue can generally be reduced to old issue to do this.

                            Where Algorithms are Used in Computer Science?

The algorithms are used in all fields of computer science. They form the back of the fields. In computer science, the algorithms give the computer a set of specific instructions and can do everything regardless of whether the computer runs the computer or runs the rocket. The computer program is an algorithm written in a programming language that the computer can understand. The computer algorithm plays a major role in how social media works: which posts are displayed, which ads are displayed, and all of the others. The algorithm is made by Google, which algorithm is the most suitable for the programming language that the computer can understand. The algorithm plays a major role in how the social media works: which posts are displayed, which ads are displayed, and which algorithm is the most suitable for the programming process, which algorithm is the most suitable for the programming process.

                            Why are Algorithms Important to Understand?

In many different areas, the ability to analyse ideas or identify clear steps to solve problems is crucial. Even if we didn't realize that, we used algorithms and algorithms to think. Arithmetic thinking enables students to break down problems and to think about solutions from the point of view of separate steps. The ability to understand and implement algorithms requires the ability of students to practice structural thinking and reasoning.

 

  Fig.no:3  Characteristics of an algorithm

                                        Applications of Algorithm

If an employee is coming from the office, he will think to reach home as soon as possible, and he will try to take the shortest path to cover the distance.

Below is some very important use case where the algorithm has been used.

• If you are searching for any item on any shopping site next time, you will get a similar type of item as a suggestion.

• If you are watching any video on YouTube next time, you will get similar type suggestions as recommended video for you.

• Have you thought about how the Google search engine works and why within seconds, results appear?

• In the same way, if we used Facebook, we will get the friend’s suggestions on the basis of some keys like School Name, College Name, Places, etc.

                        Types of Algorithms(in programming)

To make it easy in understanding , here are the very common type of algorithms:

• Searching algorithms

• Compression algorithms

• Tree and graph-based algorithms

• Pathfinding algorithm

• Sorting algorithms

• Pattern matching algorithm among many others

 

 

 

                            Advantages:

• The algorithm is very easy to understand and can be written in a simple language that anyone can understand.

• The algorithms are practically easy to implement and can be divided into different parts.

• Using the algorithm, you can easily understand the order following the processing.

 

 

 

                                Disadvantages:

• It is not easy to convert complex tasks into appropriate algorithms.

• It can be a time-consuming process to write an algorithm, and later, to implement it in a programming language.

•  To show that each step in introducing algorithms is complex, it is difficult to understand each stream in the loop and branch terminology.

 

                                        Conclusion:

Most algorithms are designed to paintings with inputs of arbitrary period. Analysis of algorithms is the willpower of the quantity of time and area sources required to execute it. The algorithms are often very different from each other, although the purpose of these algorithms is the same. For example, we know that a set of numbers can be sorted using various algorithms. It's natural to run into problems from time to time that have not been addressed recently. If you are familiar with calculations related to this situation, you are more likely to find an effective solution. In many different areas, the ability to analyse ideas or identify clear steps to solve problems is crucial. The ability to understand and implement algorithms requires the ability of students to practice structural thinking and reasoning.