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

DSA complete hand written notes

Typology: Study notes

2021/2022

Available from 04/28/2023

edu-book-store
edu-book-store 🇮🇳

5 documents

1 / 30

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e

Partial preview of the text

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 ;

  1. 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();