University of Ain Temouchent - BELHADJ Bouchaib
Faculty of Science and Technology
Department of Mathematics and Computer Science
Computer Science – 2nd Year, Semester 3 ADS 3
2025/2026 1/3
Tutorial n° 1
« Algorithmic complexity »
Exercise 1
Determine the number of elementary operations in the following algorithms:
1. S ← 0 ;
For i from 1 to n
S++ ;
EndFor
Exercise 2
For each of the following algorithms, determine the number of operations (op) performed as a function
of n.
1. For i from 1 to n
op ;
EndFor
2. For i from 1 to n
op;
EndFor
op ;
3. For i from 1 to n
For j from 1 to m
op ;
EndFor
EndFor
4. For i from 1 to n
For j from 1 to n
For k from 1 to n
op ;
EndFor
EndFor
EndFor
5. For i from 1 to n
op; op ;
For j from 1 to n
op ;
For k from 1 to n
op ;
EndFor
EndFor
EndFor
6. For i from 1 to n
For j from i to n
op
EndFor
EndFor
2. S ← 0 ;
For i from 1 to n
For j from 1 to n
S++ ;
EndFor
EndFor
3. T ← 0 ;
While (n>0) do
T ← T + n ;
n -- ;
EndWhile
