JUST ONLY USE . Not use class, not use give a choice as to which way to sort it. Write a program that reads 10 pairs of Cartesian coordinates from a file called "points.txt" and sorts them by increasing x-values, decreasing y-values, and increasing distance from the origin. Use only one sorting routine. Use an enumerated data type to keep track of the field on which the list is being sorted. The number of pairs should be in a global constant c++

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

JUST ONLY USE <iostream>. Not use class, not use give a choice as to
which way to sort it.

Write a program that reads 10 pairs of Cartesian coordinates from a file called "points.txt" and sorts them by increasing x-values, decreasing y-values, and increasing distance from the origin. Use only one sorting routine. Use an enumerated data type to keep track of the field on which the list is being sorted. The number of pairs should be in a global constant c++

```c
enum fieldType {X, Y, DISTANCE};

struct pointType
{
    double x;
    double y;
    double dist;
};
```

**Illustration Explanation:**
- On the left side, there's a cartoon goat thinking, "How far is the point (x, y) from the origin?"
- On the right side, an illustrated wizard responds, "It's the square root of x² + y²."

**Instructions:**
Use a struct to hold the points and their distances from the origin. You will read the x and y coordinates from a file and then use the Pythagorean theorem to find the distance the point is from the origin.
Transcribed Image Text:```c enum fieldType {X, Y, DISTANCE}; struct pointType { double x; double y; double dist; }; ``` **Illustration Explanation:** - On the left side, there's a cartoon goat thinking, "How far is the point (x, y) from the origin?" - On the right side, an illustrated wizard responds, "It's the square root of x² + y²." **Instructions:** Use a struct to hold the points and their distances from the origin. You will read the x and y coordinates from a file and then use the Pythagorean theorem to find the distance the point is from the origin.
Expert Solution
Step 1

By using only <iostream> I am answering this question ...

Input : 

#include <iostream>

#include <fstream>

#include <math.h>

#include<bits/stdc++.h> using namespace std;

const int num_of_pairs= 10;

class points {

public:

int x; int y;

points(){

}

points(int x,int y){ X = x;

y = y;

}

};

enum sortType {increasing By X,decreasingByY,increasingByDist}; sortType val;

bool comparePoint(points p1, points p2)

{

if (p1.x>p2.x){ return 0;

} else if(p1.x-p2.x)

{

if(pl.y<p2.y)

return 0;

else if (pl.y-p2.y) 

{

float dist1= sqrt(pow(p1.x - 0, 2) + pow(pl.y - 0, 2)* 1.0);

float dist2= sqrt(pow(p2.x - 0, 2) + pow(p2.y - 0, 2) * 1.0);

if(dist 1>dist2) return 0;

else

val-increasingByDist:

}

else 

val=decreasingByY;

}| else

val-increasingByX;

return 1;

}

int main()

{

ifstream readfile("point.txt"); points pointobj[num_of_pairs]; for (int i=0; 1 < num ; i++)

{

int x_value;

int y_value;

readfile >> x_value; readfile>>y_value;

pointobj[i].x x_value;

pointobj[i].y=y_value;

cout<<"("<<pointobj[i].x<<","<<pointobj[i].y<<<")";

}

sort(pointobj,pointobj+num_of_pairs,comparePoint);

cout<<"\nAfter sort\n"; for (int i=0; i<num_of_pairs; i++)

cout<<"("<<pointobj[i].x<<", "<<pointobj[i].y<<")";

return 0;

}

 

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY