Made-easy

Nils asked Jan 16, 2018 • retagged Jul 16, 2022 by Anjana5051

353 views

1 votes

A) Ο(logn)

B) Ο(n logn)

C) Ο(n)2

D) Ο(n2 logn)

Algorithms
algorithms
time-complexity
made-easy-test-series

+ –

Nils asked Jan 16, 2018 • retagged Jul 16, 2022 by Anjana5051

Nils

353 views

See all

2 2 Comments

hs_yadav

commented Jan 16, 2018

i think this is B O(nlogn)

0 votes

vishal chugh

commented Jan 16, 2018

Since worst case is asked i should be option C.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

The answer is b

Shalini Kr answered Jan 16, 2018 • edited Jan 16, 2018 by Shalini Kr

Shalini Kr

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

Ray Tomlinson asked Aug 9, 2023

551 views

Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))

Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1,...

Ray Tomlinson

551 views

Ray Tomlinson asked Aug 9, 2023

Algorithms
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithms

+ –

1 votes

1 answer

Ray Tomlinson asked Aug 9, 2023

882 views

Made Easy Test Series 2024
Which of the following statement(s) is/are true? (a) Quicksort and merge sort are both examples of divide and conquer algorithms. (b) If we randomly choose a pivot element each time, quicksort will always terminate in time $O(n log n).$ (c) For every fixed ... in time $O(1)$, quicksort would have worst case complexity $O(n log n)$. plese give answer and explain it why ?

Which of the following statement(s) is/are true?(a) Quicksort and merge sort are both examples of divide and conquer algorithms.(b) If we randomly choose a pivot element ...

Ray Tomlinson

882 views

Ray Tomlinson asked Aug 9, 2023

Algorithms
made-easy-test-series
made-easy-booklet
algorithms
divide-and-conquer
quick-sort
merge-sort
time-complexity

+ –

6 votes

1 answer

srestha asked May 18, 2019

2,085 views

Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??

Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any o...

srestha

2.1k views

srestha asked May 18, 2019

Algorithms
algorithms
made-easy-test-series
time-complexity

+ –

6 votes

1 answer

srestha asked May 7, 2019

2,400 views

Made Easy Test Series:Time Complexity
Consider the following program: int Bar(int n){ if(n<2) return; } else{ int sum=0; int i,j; for(i=1;i<=4;i++) Bar(n/2); for(i=1;i<=n;i++){ for(j=1;j<=i;j++){ sum=sum+1; } } } Now consider the following ... $Bar\left ( n \right )$ is $O \left ( n^{3}logn^{2} \right )$ How many statements are correct________________

Consider the following program:int Bar(int n){ if(n<2) return; } else{ int sum=0; int i,j; for(i=1;i<=4;i++) Bar(n/2); for(i=1;i<=n;i++){ for(j=1;j<=i;j++){ sum=sum+1; } ...

srestha

2.4k views

srestha asked May 7, 2019

Algorithms
made-easy-test-series
algorithms
time-complexity

+ –

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

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

2 2 Comments

0