Introduction - If you have any usage issues, please Google them yourself
The implementation of the divide-and-conquer algorithm, the input of N node data is only a number on a straight line, and the plane is realized by data on the form, which can be obtained from the nearest two points of data