don't copy the wrong answer
- Pls Show All The Work I Will Upvote If You Don T Know Pls Don T Copy The Wrong Answer 1 (122.72 KiB) Viewed 27 times
pls show all the work I will upvote, If you don't know pls don't copy the wrong answer
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
pls show all the work I will upvote, If you don't know pls don't copy the wrong answer
pls show all the work I will upvote, If you don't know pls
don't copy the wrong answer
We want to develop a divide and conquer-based algorithm to find the convex hull of n given points. (a) First, given two convex polygons P and Q which have n points in total, develop an O(n)-time algorithm to find the convex hull of their union. You have to fully explain your algorithm. You do NOT need to write the pseudo-code of your algorithm. (b) Given n points in the plane, use part (a) to develop a divide and conquer-based algorithm to find their convex hull. Your algorithm must work in O(n log n) time. Write the pseudo-code of your algorithm and justify why it satisfies the required running time.
don't copy the wrong answer
We want to develop a divide and conquer-based algorithm to find the convex hull of n given points. (a) First, given two convex polygons P and Q which have n points in total, develop an O(n)-time algorithm to find the convex hull of their union. You have to fully explain your algorithm. You do NOT need to write the pseudo-code of your algorithm. (b) Given n points in the plane, use part (a) to develop a divide and conquer-based algorithm to find their convex hull. Your algorithm must work in O(n log n) time. Write the pseudo-code of your algorithm and justify why it satisfies the required running time.