We would like to sort an array of points arr based on their distance from the origin using the insertion sort algorithm as described in the course.
Assuming you have the function int compare_points(t_point p, t_point q) described previously that compares two points p and q based on their distance from the origin, under what condition should we swap the points arr[j] and arr[j-1] ?

Question

We would like to sort an array of points  arr  based on their distance from the origin using the insertion sort algorithm as described in the course.
Assuming you have the function  int compare_points(t_point p, t_point q)  described previously that compares two points  p  and  q  based on their distance from the origin, under what condition should we swap the points  arr[j]  and  arr[j-1] ?

Answer

If  compare_points(arr[j], arr[j-1]) < 0 .

Answer

If  compare_points(arr[j], arr[j-1]) != 0 .

Answer

If  compare_points(arr[j], arr[j-1]) == 0 .

Answer

If  compare_points(arr[j], arr[j-1]) > 0 .

Crowdly

We would like to sort an array of points arr based on their distance from the ...

Want instant access to all verified answers on moodle.myefrei.fr?