algorithms

Aman Bisht 1 asked Oct 7, 2017 • retagged Jul 6, 2022 by Lakshman Bhaiya

415 views

2 votes

I think the options given for this questions are incorrect, i thing answer would be nk log nk, please correct me if i'm wrong.

Algorithms
time-complexity
algorithm-design
virtual-gate-test-series

+ –

Aman Bisht 1 asked Oct 7, 2017 • retagged Jul 6, 2022 by Lakshman Bhaiya

Aman Bisht 1

415 views

See all

1 1 comment

Rishabh Gupta 2

commented Oct 7, 2017

Please don't ask test series questions directly. Instead just ask what your doubt is. Asking test series question is not good for those who have to give the test in future.

4 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

Build a Min Heap in $O(K)$.
Heapify in $(NK-K) log K = O(NK logK)$

Kapil answered Oct 7, 2017

Kapil

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

5 votes

1 answer

gatecse asked Aug 18, 2020

468 views

GATE Overflow Test Series | Algorithms | Test 1 | Question: 26
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array $\{12, -13, -5, 25, -20, 30, 10\}$, the maximum subarray sum is $45$. The best possible algorithm to compute the maximum subarray sum will run in (Mark all the appropriate choices) $O(n)$ `$\Omega(n \log n)$ $O( \log n)$ $O(n^2)$

Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array $\{12, -13, -5, 25, -20, 30, 10\}$, the maximum subarray sum is $45$. T...

gatecse

468 views

gatecse asked Aug 18, 2020

Algorithms
go2025-algorithms-1
time-complexity
algorithm-design
multiple-selects

+ –

6 votes

3 answers

gatecse asked Aug 18, 2020

474 views

GATE Overflow Test Series | Algorithms | Test 1 | Question: 27
You are given an array $A$ of $n$ elements. The best possible algorithm to find two numbers in $A$ which sum to the largest number in $A$ will run in (assuming comparison based sorting) (Mark all CORRECT choices) $O(n)$ `$\Omega(n \log n)$ $\Omega( n^2\log n)$ $O(n^2)$

You are given an array $A$ of $n$ elements. The best possible algorithm to find two numbers in $A$ which sum to the largest number in $A$ will run in (assuming comparison...

gatecse

474 views

gatecse asked Aug 18, 2020

Algorithms
go2025-algorithms-1
time-complexity
algorithm-design
multiple-selects

+ –

0 votes

1 answer

Utsav09 asked Jan 31, 2018

382 views

Virtual Gate Test Series: Algorithms - Time Complexity
An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$ either $\{A[i] > max{A[i − 1], A[i + 1]}\},$ or $\{A[i] < min{A[i − 1], A[i + 1]}\}.$ What is the time-complexity of the fastest ... $O( \sqrt{n})$ $(C) O( \sqrt{n})$ but not $O(log n)$ $(D) O(log n)$ but not $O(1)$

An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$either $\{A[i] max{A[i − 1], A[i + 1]}\},$ or $\{A[i]...

Utsav09

382 views

Utsav09 asked Jan 31, 2018

Algorithms
algorithms
time-complexity
virtual-gate-test-series

+ –

0 votes

0 answers

Sheshang asked Jan 18, 2017

597 views

Virtual Gate Test Series: Algorithms - Time Complexity

Sheshang

597 views

Sheshang asked Jan 18, 2017

Algorithms
algorithms
time-complexity
virtual-gate-test-series

+ –

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

1 1 comment 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

1 1 comment

0