In order to complete the task, there are certain steps to be followed and this means an Algorithm. For example – buying a book online you follow certain steps like visiting the websites and searching for the book, adding to your card and then purchasing it and waiting for the order to get delivered. Following one by one step to achieve a goal makes an algorithm. It can also mean the word of programmers when do not want to explain what they did.
Analysis of Algorithm
A theoretical study of computer-program performance and resource usage is defined as Analysis of Algorithms. Other than performance in programming the other important factors are correctness, simplicity, maintainability, robustness, security, functionality, and most important user-friendliness which is way more than the performance of the program.
Every app developer and designer keeps in mind the complexity of any app and if that is not user-friendly or hard to understand then clearly outweighing algorithms. This shows performance lies beneath the bottom of the heap as compared to performance.
Sitting in front of the website which takes forever to load is kind of irritating and often the performance measure the line between feasible and in-feasibility. If an application is not fast enough it is not functional in the real time. It will not be going to work if too much memory is used. With this arm of knowledge, analyzing the simple problem of sorting is beneficial.
One of the algorithms named is Bubble Sort and the input will have a sequence of numbers and output will give sorted lists of numbers. A sorted list of numbers is generated when the function of bubble sort accepts an array of data as input.
Use these terms to analyze the algorithm
- Depends on the input for the result of the sorted list
- Input size is another factor for a sorted list
Types of Analysis to use for sorted lists.
- Worst case analysis, calculating the upper bound or running time of an algorithm.
- Average Case most useful and typically difficult measure.
- Best Case is calculating lower bound on the running time of an algorithm.