595 views

4 Answers

Best answer
6 votes
6 votes

Always Yes

Every array which is sorted in ascending order is always a min heap

And Every array which is sorted in descending order is always a max heap .

edited by
1 votes
1 votes
converse of this statement is not always true.

every array which is sorted in descending order is Max heap.

every heap may not be always sorted in descending order array. e-g - 20 18 12 16 15 10 9
0 votes
0 votes

An array sorted in ascending order is can be treated as min- heap" and its complementry statement is "An array sorted in descending order can be treated as max heap".

Answer:

Related questions

2 votes
2 votes
2 answers
1
Bikram asked Oct 4, 2016
764 views
About how many compares will Quicksort() make when sorting an array of N items that are all equal?$\Theta(\lg N)$$\Theta(N\lg N)$$\Theta(\lg \lg N)$$\Theta(N/\lg N)$
3 votes
3 votes
1 answer
3
Bikram asked Oct 4, 2016
829 views
You are given a 1 billion numbers. The time require in seconds to sort them provided sorting thousand numbers takes 100 microseconds will be _______10,00051230065536