Complexity

Question

what are the various ways to analyze the complexity of program

Answer 1

Hi Elizabeth,
In computer Science there is a whole field dedicated to the study of complexity of algorithms, and therefore programs (as they are the implementation of algorithms).
For the sake of simplicity I will assume that you are using the word program as a synonym for algorithms. In design and analysis of algorithms is very common the use of the Omega notation for expressing the complexity of an algorithm, usually in number of operations, which depend on the input parameters.
For example, the search for a given number in an unsorted array of integers can be done, in the worst case, in linear time on the size of the array, i.e. O(n), where n is the array size.

Answer 2

My Opinion :
1. The objective of the program
2. Amount of class and function
3. The type of service it provide