The document outlines a mathematical analysis of a non-recursive algorithm by determining input size and identifying basic operations. It focuses on the operation of comparisons made to find the largest value in an array and analyzes the execution count of these comparisons under different scenarios (best, worst, average). The analysis includes simplification of sums related to the number of comparisons based on input size n.

1. Mathematical analysis of
non-recursive algorithm

2. General plan
• Decide the input size.
• Identify basic operations.
• Check how many time basic operations is
executed & determine best,worst,avg case
analyzed seperately.
• Set up sum for basic operation.
• Simplifying the sum using std formula &
rules.

4. • The input size is n.
• The basic operation is comparison in loop for
finding largest value.
• Comparison made for each value for n.
• C(n) be the no.of.times comparison is executed.
• C(n)=one comparison.
• Simplify the sum.
Mathematical analysis

7. Mathematical analysis
• The input size of the problem is n
• The basic operation is if A[i]==A[j]
• The outer loop will be executed first to last but one
element and inner loop is executed 2 to n array
index.
• C(n) no.of.comparison statement is executed in
worstcase.