如何在 Java 中通过 MergeSort 对点数组进行排序？

Question

我创建了 Point 类，并且有一个 Point 对象的数组列表，我想按归并排序对其进行排序。

Answer 1

Assuming you are talking about 2D or 3D points, you would have to think about defining a metric such that they are orderable.

Consider the exampe points (1,0) and (0,1) in 2D space. Is (1,0) > (0,1) ? Or (1,0) < (0,1) ? It really depends on the application.

You could eg take just the first component as metric, then it would be (1,0) > (0,1) . Or you could take the distance from a specific point, eg the origin (0,0) , in which case they would be equal.

Anyways, after you have decided on that, you can look up existing implementations of sorting algorithms (you seem to be determined about MergeSort though), on the internet. Here is one example.

Most interfaces to sort function in various programming languages require either a key function (eg "get first component" or "distance from origin"), or a custom comparison operator.