Hi, I need some help with this Data Structures and Algorithms Analysis question.

Question

Hi, I need some help with this Data Structures and Algorithms Analysis question.

Select all the statements below which are TRUE O Counting sort is a comparison sort algorithm. O Let A be a max-heap of height h. In the worst-case h- (n) Let L be a doubly-linked list with n elements. Then finding the successor of an element x takes (n) in the worst-case O In a min-heap A, for every node i s (n-1)/2 the value Alil s A[2i and Ali] s A[2i+1]. O The Heap sort algorithm is more efficient than the Insertion sort algorithm. O The Heap sort algorithm uses divide-and-conquer approach.

Explanation / Answer

Answer:

2,3,5 are true:)

Explanation:

>> counting sort is not a comaprsion sort algorithm .It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence.

>> Theoretically, insertionsort is faster up to about 50 items, and it is a stable sort; heapsort is faster for more items. so heaping sort algorithm is efficient

>> Heap sort is typically outperformed by quicksort, except that quicksort has a worst-case complexity of O(N^2) (versus heap sort's worst case of O(N.logN) ). so not a divide nad conquer approach

>> Worst case of heap O(n) at max heap:)

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.