Math, asked by criazhoran6056, 1 year ago

Write the steps involved in analyzing the efficiency of nonrecursive algorithms

Answers

Answered by debarati1089
6

Hey Mate!!

Step-by-step explanation:

Analyzing the efficiency of non-recursive efficiency :

  1. Decide the input size based on the constraint.
  2. Identify the basic Operations of algorithm.
  3. Check the number of times the basic operation is executed. Find whether the execution of basic Operations independent on input size n or not. If the basic operation is depending on the worst case, best case nd average case then analyse from algorithm needs more attention.

4. Simplify the sum using standard. formula and rules.

May this help u mate!!

Answered by lakshaymadaan18
4

1. Decide on problem size specification

2. Identify basic operation

3. Check worst, best, average case

4. Count: set up the sum

5. Evaluate or determine order of sum

Similar questions