Empirical Analysis

Algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Then the word “empirical” refers to the information gained by means of observation, experience, or experiment. Therefore, empirical algorithm helps us to analyze the information about the particular algorithm.

There are two branches of empirical algorithm. First is the empirical analysis that deals with the characterization of the behavior of algorithms. Second is the algorithm engineering focuses on empirical methods for improving the performance of algorithms.

Analysis of algorithm

Algorithm analysis is a field of computer science that is dedicated to understand the complexity of algorithm. It also provides theoretical estimates for the resource needed by any algorithm which solves a given computational problem. It helps us to know the efficiency or running time of an algorithm as a function relating the input length to the number of steps or storage location and capacity.

Bog-oh notation

Describe the limiting behavior of a function when the argument tends towards a particular or infinity, usually in terms of simpler function.

++Referrence: Wikipedia.com++