Mathematical Analysis of Non-Recursive Algorithm.
Download as PPTX, PDF1 like12,414 views
The document outlines a mathematical analysis of a non-recursive algorithm focusing on input size and basic operations. It emphasizes the execution of comparisons within nested loops to determine the largest value, analyzing best, worst, and average cases separately. The analysis provides a formula for simplifying the total number of comparisons based on the input size n.
1 of 8
Downloaded 10 times
![Mathematical analysis
• The input size of the problem is n
• The basic operation is if A[i]==A[j]
• The outter loop will be executed first to last but
one element and inner loop is executed 2 to n
arrary index.
• C(n) no.of.comparison statement is executed in
worstcase.](https://image.slidesharecdn.com/mathanonrecur-210418115317/85/Mathematical-Analysis-of-Non-Recursive-Algorithm-7-320.jpg)
Mathematical Analysis of Non-Recursive Algorithm.
- 1. Mathematical analysis of non-recursive algorithm Bharati.C M.Tech
- 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 outter loop will be executed first to last but one element and inner loop is executed 2 to n arrary index. • C(n) no.of.comparison statement is executed in worstcase.