In a divide-and-conquer algorithm, it is advisable to use a simpler algorithm when subproblems become small enough, since the constant factor in a divide-and-conquer algorithm is usually larger than a simpler one.
As for the algorithm we implemented, it can be improved by using insertion sort when the number of points becomes sufficiently small.
@scps940707 @sifmelcara @chuanchan1116 @david50407 @firejox
Please improve your implements if it is convenient to you.
For your reference, improve cpp with insertion sort.
In a divide-and-conquer algorithm, it is advisable to use a simpler algorithm when subproblems become small enough, since the constant factor in a divide-and-conquer algorithm is usually larger than a simpler one.
As for the algorithm we implemented, it can be improved by using insertion sort when the number of points becomes sufficiently small.
@scps940707 @sifmelcara @chuanchan1116 @david50407 @firejox
Please improve your implements if it is convenient to you.
For your reference, improve cpp with insertion sort.