Quicksort is asymptotically faster than bubblesort - a. In the worst case Yes No

Question

Quicksort is asymptotically faster than bubblesort - a. In the worst case Yes No Don't know b. On average Yes No Don't know Quicksort is asymptotically slower than mergesort - a. In the worst case Yes No Don't know b. On average Yes No Don't know To sort 8 numbers it is necessary to make at least a. 16 comparisons Yes No Don't know b. 17 comparisons Yes No Don't know To find 2 heavier coins among 15 same coins using lever scales it is necessary to make at least a. 6 comparisons Yes No Don't know b. 5 comparisons Yes No Don't know Given set S of points in the Euclidean plane, Voronoi graph of S always a. contains MST of S Yes No Don't know b. has at most 3.16 * |S| edges Yes No Don't know c. has at most 2.85 *|S| edges Yes No Don't know d. has at least |S| + 1 edges Yes No Don't know e. contains edge connecting closest pair of points Yes No Don't know Given set S of points in the Euclidean plane, convex hull of S always a. contains MST of S Yes No Don't know b. has at most 2.5*|S| edges Yes No Don't know c. has at least 1.05*|S| edges Yes No Don't know d. contains edge connecting closest pair of points Yes No Don't know

Explanation / Answer

1)

b) on the average case

because queck sort is better then perfamance to bubble sort

2)

a) in the worst case

3)

a) 16 comparisions

4)

a) 6 comparisions

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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