Empirical Analysis, Algorithm Analysis and Big oh Notation

Empirical Analysis

Is an analysis that is based on your observation, experience or experiments.

As I have research there are many steps to achieve an empirical analysis:

• Choose on the essential process.
• Think and choose your input sample (range, size,...).
• Convert the algorithm to a program
• Create a sample of inputs.
• Execute the program;
• Evaluate the data.

Algorithm Analysis

Is an analysis to determine the amount of the resources and the efficiency of the algorithm that you use in your program. And also as we analyze an algorithm we can determine the running time of a program as a function of its inputs, determine the total or maximum memory space needed for program data, determine the total size of the program code, determine whether the program correctly computes the desired result, determine the complexity of the program--e.g., how easy is it to read, understand, and modify, and determine the robustness of the program--e.g., how well does it deal with unexpected or erroneous inputs?

Big oh Notation

The Big-O notation describes the behavior of a function for big inputs. It tries to capture the core of a function.