Register

Recent questions tagged heap-sort

0 votes
1 answer
1
ISRO 2024
Worst case time complexity of heap sort for n elements O(nlogn) O(logn) O^2 O(n)
Worst case time complexity of heap sort for n elementsO(nlogn)O(logn)O^2O(n)
User Avatar
1 votes
2 answers
3
Gate Applied Practice Test
Question--> The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
Question The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
User Avatar
1 votes
2 answers
4
UGC NET CSE | December 2004 | Part 2 | Question: 25
How much extra space is used by heapsort ? $O (1)$ $O (\log n)$ $O (n)$ $O (n^2)$
How much extra space is used by heapsort ?$O (1)$$O (\log n)$$O (n)$$O (n^2)$
User Avatar
0 votes
0 answers
5
Cormen Edition 3 Exercise 6.4 Question 5 (Page No. 161)
Show that when all elements are distinct, the best-case running time of HEAPSORT is $\Omega(n\lg\ n)$.
Show that when all elements are distinct, the best-case running time of HEAPSORT is $\Omega(n\lg\ n)$.
User Avatar
0 votes
0 answers
7
Cormen Edition 3 Exercise 6.4 Question 3 (Page No. 160)
What is the running time of HEAPSORT on an array $A$ of length $n$ that is already sorted in increasing order? What about decreasing order?
What is the running time of HEAPSORT on an array $A$ of length $n$ that is already sorted in increasing order? What about decreasing order?
User Avatar
1 votes
1 answer
11
# Heap sort
Sort The Following Sequence of input using Heap sort. { 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 } Please show the output at every pass because i am getting confused.
Sort The Following Sequence of input using Heap sort.{ 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 }Please show the output at every pass because i am getting confused.
User Avatar
0 votes
1 answer
12
Sorting:
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate? 1)QuickSort 2)MergeSort 3)HeapSort 4)Selection Sort Explain? How
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?1)QuickSort2)MergeSort3)HeapSort4)Selection Sort...
User Avatar
0 votes
1 answer
13
Heap Sort
Would it be possible to implement a variant of heapsort based on a perfectly balanced ternary structure in which the children of node $i$ are at positions $3i - 1, 3i$, and $3i + 1$, and if so what would be the advantages and disadvantages of the new method?
Would it be possible to implement a variant of heapsort based on a perfectly balanced ternary structure in which the children of node $i$ are at positions $3i - 1, 3i$, a...
User Avatar
1 votes
3 answers
14
Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they wereinitially in sorted order, initially in reverse sorted order?
User Avatar
0 votes
0 answers
15
Sorting
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort 2. Quick Sort 3. Merge Sort 4. Heap Sort Please explain why others 3 sorting algorithms except the answer can't be used ?
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort2. Quick Sort3. Merge Sort4. Heap Sort Please explain why others 3 sorting algorith...
User Avatar
0 votes
0 answers
17
Cormen 3rd edition Q.6.5-9
Give an O(n lgk)-time algorithm to merge k sorted lists into one sorted list, where n is the total number of elements in the input lists. Use a min heap for k-way merging.
Give an O(n lgk)-time algorithm to merge k sorted lists into one sorted list, where n is the total number of elements in the input lists. Use a min heap for k-way merging...
User Avatar
2 votes
1 answer
18
Sorting
User Avatar
0 votes
1 answer
21
complexity analysis
Space complexity = input size + extra space So, heap sort also takes input of an 'n' size array. Does this mean that space cost of heap sort algo is O (n).
Space complexity = input size + extra spaceSo, heap sort also takes input of an 'n' size array.Does this mean that space cost of heap sort algo is O (n).
User Avatar
1 votes
3 answers
22
Self doubt
You are asked to sort 15 randomly generated numbers. One should prefer— (a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sort I think the answer should be c or d crct me???
You are asked to sort 15 randomly generated numbers. One should prefer—(a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sortI think the answer should be c or d cr...
User Avatar
1 votes
1 answer
24
proof
1) Show that when all elements are distinct, the best case running time of HEAPSORT is Ω(n log n). 2) Show that the worst case running time of HEAPSORT is Ω(n log n).
1) Show that when all elements are distinct, the best case running time of HEAPSORT is Ω(n log n).2) Show that the worst case running time of HEAPSORT is Ω(n log n).
User Avatar
2 votes
1 answer
25
#HeapSort
What is the worst case time complexity of finding a element in max heap tree ? Explain.
What is the worst case time complexity of finding a element in max heap tree ?Explain.
User Avatar
1 votes
2 answers
26
Algorithm
what is the time complexity of finding a number in a heap sort in worst case & what is the time complexity for deleting the element from heap?
what is the time complexity of finding a number in a heap sort in worst case & what is the time complexity for deleting the element from heap?
User Avatar
2 votes
1 answer
27
WHICH SORTING TO SELECT?
As part of maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be— (a) Bubble sort (b) Insertion sort (c) Selection sort (d) Heap sort
As part of maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be...
User Avatar
0 votes
2 answers
28
Sorting
User Avatar
Page: