We would like to sort an array of squares arr based on their area using the insertion sort algorithm as described in the course.
Assuming you have the function int compare_squares(t_square sq1, t_square sq2) described earlier that compares two squares sq1 and sq2 based on their area, under what condition should we swap the squares arr[j] and arr[j-1] ?

Question

We would like to sort an array of squares  arr  based on their area using the insertion sort algorithm as described in the course.
Assuming you have the function  int compare_squares(t_square sq1, t_square sq2)  described earlier that compares two squares  sq1  and  sq2  based on their area, under what condition should we swap the squares  arr[j]  and  arr[j-1]  ?

Accepted Answer

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

Answer

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

Answer

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

Answer

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

Crowdly

We would like to sort an array of squares arr based on their area using the in...

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