Symmetric min max heap

what is the time complexity of various problems such as:1) Creating the heap2) Getting maximum element in the max heap3) Getting minimum element in the max heap4) Getting...

Hira Thakur

594 views

Hira Thakur asked Jan 1, 2019

Programming in C
binary-heap
data-structures

+ –

3 votes

1 answer

sushmita asked Mar 23, 2017

2,689 views

min max using divide and conquer
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER?? RECURRENCE RELATION IS $ T(n) = 2 T(\frac{n}{2}) + 2 $ IT SHOULD COME TO $ \frac{3*n}{2} - 2 $ ??

CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER??RECURRENCE RELATION IS$ T(n) = 2 T(\frac{n}{2}) + 2 $IT SHOULD ...

sushmita

2.7k views

sushmita asked Mar 23, 2017

Algorithms
divide-and-conquer
algorithms

+ –

4 votes

2 answers

deep05 asked Feb 27, 2017

2,985 views

max min in an array
Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 comparisons without divide and conquer. Algorithm A2 can compute min-max in a2 comparisons by scanning the array linearly. What could be the relation between a1 and a2 considering the worst case scenarios?

Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 compari...

deep05

3.0k views

deep05 asked Feb 27, 2017

Algorithms
algorithms
array
maximum-minimum

+ –

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.

0 Answers

Related questions

2 2 Comments