This is a theory of algorithm type of assignment. Theassignment.docx/pdfwill be your guide. I want...

Question

This is a theory of algorithm type of assignment. Theassignment.docx/pdfwill be your guide. I want you to answer questions 1 - 5 and send the updated docx back to me. If anything is done wrong, this assignment will not be considered complete/correct. You also can't plagiarize! The answers need to be completely unique.

Swapnil · Accepted Answer

1
	The starting point of all lines is 0,0 which can give the origin point. 
The set C contains n circles, here every circle c_i have an information about its radius r_i and its center coordinate (x_i, y_i).
Greedy rules are following:
· iterate over each circle in the set C and pick c_i.
· construct 3 lines from origin to c_i.
· iterate over other remaining circles c_j (j != i).
· choose the line L_i and remove the circles that intersect.
· continue until the plane is empty.
And this will give the solution of time complexity is O(nlogn).
Code:
struct Angle 
{
    int s, e;
};
vector opt_pts(vector &angles) 
{
    std::sort(angles.begin(), angles.e(), [](const Angle &a, const Angle &b) -> bool 
    {
        return a.e  ptss; 
    int pts = angles[0].e; 
    ptss.push_back(pts);

This is a theory of algorithm type of assignment. The assignment.docx/pdf will be your guide. I want you to answer questions 1 - 5 and send the updated docx back to me. If anything is done wrong, this...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment