Register

class book

232 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
2
amit166 asked Sep 11, 2018
221 views
class notes
find time complexity f(int n){ int i=1; while(i<n) { int j=n; while(j>0) j=j/2; i=i*2; } }
find time complexityf(int n){int i=1;while(i<n){int j=n;while(j>0)j=j/2;i=i*2;}}
User Avatar
0 votes
0 votes
0 answers
3
targate2018 asked Dec 5, 2017
614 views
class test
Given an array of n numbers, a median x exists such that x is larger than at least n/20 of the numbers and smaller than at lest n/20 numbers. If this x is used as a pivot in quick sort. What is the worst case running time of this algorithm? a. O(n) b. O(n11/10) 3. O(nlogn) 4.O(n2) 5. O(n10/11 log n)
Given an array of n numbers, a median x exists such that x is larger than at least n/20 of the numbers and smaller than at lest n/20 numbers. If this x is used as a pivot...
User Avatar
0 votes
0 votes
3 answers
4
targate2018 asked Dec 5, 2017
647 views
class test
m=1; for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)} What is the complexity of above algorithm? 1. O(n*m3) 2. O(n3) 3. O(3n) 4. O(3m)
m=1;for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)}What is the complexity of above algorithm?1. O(n*m3)2. O(n3)3. O(3n)...
User Avatar
Link Copied!