1. (10 points) Answer the following questions. a. b. c. What is the lower bound

Question

1. (10 points) Answer the following questions. a. b. c. What is the lower bound of comparison based sorting algorithm? What is stable sorting property? Which of the following sorting algorithms are stable? Insertion sort, selection sort, merge sort, quick sort What is the worst case running time of bucket sort in terms of input size n and value range O. N-1? d. e. What is the worst case running time of radix sort in terms of input size n, value range O. N-1 for each dimension, and total dimension number d?

Explanation / Answer

a. NlogN

b. A sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sortedoutput as they appear in the input unsorted array.

c. Insertion Sort, Merge Sort

d. O(n^2)

e. O(nLogd(n))

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

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