# Analyzing Algorithm Control Structure in DAA To study the overall performance of a programming code or algorithm, each instruction must be examined independently. However, some algorithm control structures are included in every programming code and have their own asymptotic analysis. Control Structures are just a method of describing the flow of control in a program. If self-contained modules, known as control structures, are used, any algorithm or program may be made more simple and understandable. This article gives you details of analyzing different control structure in an algorithm or program.

Index of Article (Click to Jump)

## Sequencing

Suppose an algorithm has two blocks, Block A and Block B, which takes time TA and TB respectively, for computation. According to the sequence rule, the total computation is (TA + TB) and thus, computation time is (max (TA,TB)) according to maximum rule.

For example, Let us suppose TA =O (n) and TB = θ (n2).

Then, Computation Time = TA + TB = (max (TA,TB) = (max (O (n), θ (n2)) = θ (n2)

## If-Then-Else

In If-then-else, algorithm have to select only one block according to given condition. An algorithm have two blocks, Block A and Block B, which takes time TA and TB, respectively, for computation; however, according to if-elsecondition, only one block, either Block A or Block B, will be executed. So, the total computation time will be Max(TA,TB), according to maximum rule.

For example, suppose TA =O (n2) and TB = θ (n2).

Total Computation = (max (tA,tB)) = max (O (n2), θ (n2))= θ (n2)

## For Loop For loop is used when we want to repeat a group of statements over and over again. This loop guarantees that the collection of statements we wish to repeat is performed as many times as we wish. Let us analyze it with the help of an example:

The Assignment and arithmetic operations are considered as constants while calculating complexity, therefore, their time complexities are represented as O(1). Secondly, in loop “i<n”, the variable “i” is dependent on the input variable “n”. So, the larger the input size n, the longer the program will run, hence it is not constant, i.e., O(n).

Time complexity Big “O”=O(1) + O(n)= O( 1 + n)

By ignoring the constant O(1), we can write Big “O”=O(n)

## Nested Loops

Nested loop refers to loop inside another loop. Let’s see its analysis with the help of example.

In this example we have  two loops, both the inner loop  and the outer loop are dependent on the input size ‘n’. So, we have two O(n) and two constant O(1).

The time complexity, Big “O”= ( O(1) + O(n) + O(n) ) = O ( 1+ n + n)

Ignoring the constant O(1), we get Big “O”= O ( n2)

## While Loop The simplest method for analyzing the loop is to figure out the purpose of the variable involved, whose value lowers with each iteration. That value must be a positive integer in order for the loop to be terminated. The number of repetitions of the loop may be calculated by keeping track of how many times the value of the function lowers. Let us see in following examples:

### Example 1:

while ( n > 0 ) {

n = n – 1
}

The time for the above code will be Θ(n)

### Example 2:

while ( n > 0 ) {

n = n / 2
}
i = 0; j = n

In this example code, total computation will be equal to Θ(log n)

### Example 3:

while ( i < j ) {

i++; j–;
}
In this case, the computation time taken by the code will be Θ(n)