I\'m kinda confused about these questions, could anyone explain to me? thanks! 1

Question

I'm kinda confused about these questions, could anyone explain to me? thanks!

181. Suppose the recurrence equation T(p, q) = T (p, q-1) + ? (p) is used to describe radix sort. Considering only the sorting of the numbers on a particular digit, which sort is consistent with that equation? A. selection sort B. mergesort sort C. radix sort D. counting sort 182. Suppose the recurrence equation T (p, q-T (p, q- 1) + 0(plog p) is used to describe radix sort. Considering only the sorting of the numbers on a particular digit, which sort is consistent with that equation? A. counting sort B. mergesort sort C. radix sort D. selection sort

Explanation / Answer

1)Answer:
Counting Sort:
Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing).
2).Answer:
Merge Sort
The Merge sort is the Better to Use,The Merge Sort will uses the Divide and Conquer Strategy.
The Time Complexity of Merge sort is:?(n log(n))
->Many algorithms,particularly divide and conquer algorithms,have time complexities which are naturally
modeled by recurrence relations.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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