if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation: (1,1) is first because 12+12=2 is the smallest (3,2) is next becaus
Write a function that gets an array of points and sorts the array using qsort().
Given two points a=(ax,ay) and b=(bx,by) we compare them as follows:
1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array.
2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate.
Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0).
That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function.
For example:
- Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)]
- Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ]
Explanation:
(1,1) is first because 12+12=2 is the smallest
(3,2) is next because 32+22 = 13 is the second smallest
Both (3,4) and (5,0) have the same sum of squares, 25, but 3<5 so (3,4) comes before (5,0)
(7,1) is lest because 72+12=50 is the largest
**Note that we do allow some points in the array to be equal.
void sort_points(point* A, int length);
test provided for the function:
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
