Scribd
Upload
17 views30 pages

Big O, LL, Stack, Array

Uploaded by

janhvilkw
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views30 pages

Big O, LL, Stack, Array

Uploaded by

janhvilkw
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

ingredients to write efficient algo

HDD me data lambe time ke liye store kiya jata hain

pyq

main memory matlb RAM

HDD(hard disc drive) se data lete hain(retrieve karte hain), update karte hain fir send

legacy data purana data hota hain joki main data se alag rakha jata hain
ya acha algo bade input ke liye kam time me run hota hain

rohan's kyunki acha algo


zyada data kam time me
process karleta hain
F
pyq explain big o notation in 5
marks

Source: https://stackoverflow.com/questions/3255/big-o-how-do-you-calculate-approximate-it
pyq
memory/storage
O(n) kyunki n! ke liye n calls hongin too stack me max utni jagah ghiregi jitni
function ko n times call karne me ghirti
URBAN
Time Complexity – Competitive Practice Sheet

1. Fine the time complexity of the func1 function in the program show in program1.c as follows: O(length)

#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: O(n^2)

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);
}
}

}
3. Consider the recursive algorithm above, where the random(int n) spends one unit of time to return a
random integer which is evenly distributed within the range [0,n][0,n]. If the average processing time
is T(n), what is the value of T(6)?
6
int function(int n)
{
int i;

if (n <= 0)
{
return 0;
}
else
{
i = random(n - 1);
printf("this\n");
return function(i) + function(n - 1 - i);
}
}

4. Which of the following are equivalent to O(N)? Why?


a) O(N + P), where P < N/9
b) 0(9N-k)
c) O(N + 8log N)
d) O(N + M2)

5. The following simple code sums the values of all the nodes in a balanced binary search tree. What is its
runtime? O(n) where n's no. of nodes

int sum(Node node)


{
if (node == NULL)
{
return 0;
}
return sum(node.left) + node.value + sum(node.right);
}
6. Find the complexity of the following code which tests whether a give number is prime or not?

int isPrime(int n){ O(n^(1/2))


if (n == 1){
return 0;
}

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


if (n % i == 0)
return 0;
}
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) O(1) kyunki condition me n nahi aaraha hain too constant time
return 0; me run hoga chhahe n ki value kuch bhi ho
}

return 1;
}
isPrime();
Sequential Search

(worst case)

pyq

pyq difference b/w both


URBAN
warning/caution
URBAN
Scanned with
abstract data type
URBAN

You might also like