We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- A Basic Quiz on Algorithms #1
- Discussions
A Basic Quiz on Algorithms #1
A Basic Quiz on Algorithms #1
Sort by
recency
|
30 Discussions
|
Please Login in order to post a comment
Solution:
For a better understanding of fundamental aspects of data structure and algorithms read domyhomework. You can find info on this algorithm there too.
how can i check my answer???
Hi.i can't clearly understand about the algorithm.can u explain me
Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms ? How come the answer is not o(nlogn)? If you are talking about heap then it must be min heap or max heap.Max/Min heapify takes o(log(n)).So it should be o(nlogn).Please let me know if i am missing something.
There is an algorithm, invented by Floyd, that heapifies'' an array in O(n). It does it in a bottom-up manner, if you just insert each of the elements in a heap one by one of course it's O(n log n).
http://www.cs.umd.edu/~meesh/351/mount/lectures/lect14-heapsort-analysis-part.pdf
Nice Explanation.Thanks! :)