DSA complete hand written notes, Study notes of Advanced Data Analysis

Download DSA complete hand written notes and more Study notes Advanced Data Analysis in PDF only on Docsity!

Source: https://stackoverflow.com/questions/3255/big-o-how-do-you-calculate-approximate-it

URBAN

Time Complexity – Competitive Practice Sheet

1. Fine the time complexity of the func1 function in the program show in program1.c as follows: #include <stdio.h> void func1 (int array[], int length) { int sum = 0 ; int product = 1 ; for (int i = 0 ; i < length; i++) { sum += array[i]; } for (int i = 0 ; i < length; i++) { product *= array[i]; } } int main () { int arr[] = { 3 , 5 , 66 }; func1 (arr, 3 ); return 0 ; }
2. Fine the time complexity of the func function in the program from program2.c as follows: void func (int n) { int sum = 0 ; int product = 1 ; for (int i = 0 ; i < n; i++) { for (int j = 0 ; j < n; j++) { printf ("%d , %d\n", i, j); } } }

return 1 ;

7. What is the time complexity of the following snippet of code?

int isPrime (int n){

for (int i = 2 ; i * i < 10000 ; i++) {

if (n % i == 0 )

return 0 ;

return 1 ;

isPrime();