Recent questions tagged time-complexity

0 votes

1 answer

1

JEST Sample Question 1-d
T (n) = T (n/2) + 2; T (1) = 1 When n is a power of 2, the correct expression for T (n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D)2 log n + 1

asked Feb 15 in Algorithms by sripo Active (1.5k points) | 56 views

+1 vote

6 answers

2

GATE2019-37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$

asked Feb 7 in Algorithms by Arjun Veteran (385k points) | 3.1k views

0 votes

0 answers

3

Can Merge Sort Time Complexity be O(n^2) in any condition?

asked Feb 1 in Algorithms by aditykansara (23 points) | 81 views

0 votes

1 answer

4

ME Mock 4
Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sorted array as output. Here's the pseudo-code for RumbleSort. With regards to the above RumbleSort ... algorithm will work correctly for a given input is $\mathcal Ο(n^2)$ Which of the above statements is/are true?

asked Jan 30 in Algorithms by balchandar reddy san Active (2.7k points) | 89 views

0 votes

1 answer

5

Random Doubt in f(n)=O(n^2)
Can any one please help me out in understanding how to read : f(n)=O(n^2) I am confused in : 1] f(n) is the upper bound of n^2 2]f(n)’s upper bound is n^2 Or is their any another way of reading it out…! THANK YOU

asked Jan 25 in Algorithms by Nandkishor3939 Active (1.2k points) | 15 views

0 votes

0 answers

6

Time complexity
Time complexity of second part?

asked Jan 22 in Algorithms by bts1jimin (245 points) | 18 views

0 votes

1 answer

7

Recurrence relation and Time Complexity
What is the time complexity of the following recurrence relation and step to derive the same $T(n) = T(\sqrt{n}) + log(logn)$

asked Jan 20 in Algorithms by VikramRB (205 points) | 76 views

0 votes

1 answer

8

Time complexity

asked Jan 20 in Algorithms by Rackson Active (1.9k points) | 40 views

+1 vote

1 answer

9

GATEBOOK-2019 Mock Test1-52
The intended purpose of this code is to precompute all the primes less than $N.$ When it is finished executing, for $r \in [2, N),$ $bits[r]$ is supposed to equal $1$ if and only if $N$ is composite. Assume that the bits array is initialized to all zeroes. for ... $n < N$ is prime. I only I and II only II and III only I, II, and III

asked Jan 19 in Algorithms by GATEBOOK Boss (15.3k points) | 200 views

0 votes

1 answer

10

Time Complexity
I am unable to Find its time complexity using Iterative method… Will any one help me out with this . Thank you :)

asked Jan 18 in Algorithms by Nandkishor3939 Active (1.2k points) | 77 views

0 votes

1 answer

11

sorted list
we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to a) O ( log m log(log n) ) b) O ( log n log(log m) ) c) O ( log m log n) d) O ( m log log n)

asked Jan 16 in Algorithms by Rahul_Rathod_ Junior (565 points) | 51 views

0 votes

0 answers

12

Finding the minimum element in a Heap
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap? Thank you:)

asked Jan 15 in DS by Nandkishor3939 Active (1.2k points) | 120 views

0 votes

0 answers

13

Asymptotic notation
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)

asked Jan 12 in Algorithms by bts1jimin (245 points) | 46 views

0 votes

0 answers

14

Algorithms Time complexity

asked Jan 12 in Programming by Rackson Active (1.9k points) | 42 views

+2 votes

0 answers

15

#madeeasy test series
Ω($n^2$) Ω($nlogn$) and O($n^2$) Θ(n) O(n)

asked Jan 8 in Algorithms by Ramij (353 points) | 82 views

0 votes

0 answers

16

#madeeasy test series
Ω($n^2$) Ω($nlogn$) and O($n^2$) Θ(n) O(n)

asked Jan 8 in Algorithms by Ramij (353 points) | 26 views

0 votes

0 answers

17

Recurrence relation
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP

asked Jan 4 in Algorithms by Mayankprakash Active (1.1k points) | 100 views

0 votes

0 answers

18

Time complexity (Advance Level)
The difference of time Complexity between given functions can be represented by: void fun1(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) for(int k=1;k<=j;k++) s++; return 0; } void fun2(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) for(int k=1;k<=j;k++) s++; return 0; } $i. O(n^2)$ $ii. O(n)$ $iii.O(1)$ $iv. O(n^{1.5})$

asked Jan 4 in Algorithms by shreyansh jain Active (2.1k points) | 69 views

0 votes

1 answer

19

Time Complexity of Code snippet
What will be the worst case time complexity for the following code segment? int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } } Options: O(N^4) O(N^3) O(N^2) O(N)

asked Jan 4 in Algorithms by saptarshiDey (83 points) | 84 views

0 votes

0 answers

20

Time complexity
How to analyze this problem For (I=1;I<n;I++) { For (j=1;j<n;j=j+I) { Print("℅d℅d", I,j); } } Please suggest I'm detail how do we unroll I & j.

asked Jan 3 in Algorithms by Mayankprakash Active (1.1k points) | 40 views

0 votes

1 answer

21

Self Doubt[Gate Question]
Let T(n) be a function defined by the recurrence T(n)=2T(n/2)+√n for n≥2 andT(1)=1 Can someone please explain solution of this using back substitution

asked Jan 2 in Algorithms by jatin khachane 1 Loyal (6.4k points) | 28 views

0 votes

0 answers

22

The time complexity for the possible ways of multiplying the given set of n matrices.

asked Jan 1 in Algorithms by susgir2 Active (1.4k points) | 21 views

0 votes

1 answer

23

time complexity

asked Dec 30, 2018 in Algorithms by Rahul_Rathod_ Junior (565 points) | 28 views

0 votes

0 answers

24

Madeeasy - Time complexity 2019
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?

asked Dec 29, 2018 in Algorithms by Markzuck Junior (635 points) | 59 views

0 votes

0 answers

25

ME FT test: Algorithms
Let an array A has n elements, where each element is a natural number. it is known that the array A has exactly r number of inversions. now every element int he array is made negative. then the time complexity of the most efficient algorithms which ... asked the number of inversions, answer would be O(1). please give your approach, and what do you think answer should be?

asked Dec 27, 2018 in Algorithms by aambazinga Active (3.2k points) | 50 views

0 votes

1 answer

26

#timecomplexity
What is difference between tightest upper bound and tightest lower bound? Give ur explanation with examples?

asked Dec 26, 2018 in Algorithms by Deepesh Pai (499 points) | 23 views

0 votes

0 answers

27

Highest best case implies worst case?
Which of the below given sorting techniques has highest best-case runtime complexity. (A) Quick sort (B) Selection sort (C) Insertion sort (D) Bubble sort Answer: (B) Explanation: Quick sort best case time complexity is Ο(n logn) Selection sort ... -12/ I did not understand this as best case time should be O(n) sorting method what does highest best cases mean?

asked Dec 23, 2018 in Algorithms by sripo Active (1.5k points) | 50 views

+1 vote

1 answer

28

Deleting a random node from Heap
What is the time complexity of 'deleting any random node from a max or min heap'?

asked Dec 21, 2018 in DS by Avijit Shaw (149 points) | 97 views

0 votes

0 answers

29

#madeeasy
O($n^2$) O(n) O(nlogn) O($n(logn)^2$

asked Dec 21, 2018 in Algorithms by Ramij (353 points) | 57 views

0 votes

1 answer

30

Test series by ************ ******
Anand want to send a Love Letters(LL) to his girlfriend. Due to confidentiality problems he was used only combination of either '0' or '1' characters. He also maintained restriction(or code word) that There are no two consecutive '1's in Love Letters(LL). According to the ... in Love Letters (LL) is bounded by__? 1. O(n2) 2.O(nlogn) 3. O(2n) 4.O(n)

asked Dec 20, 2018 in Algorithms by Hardik Vagadia (497 points) | 105 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged time-complexity

Recent Posts

Recent Blog Comments