In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic.) This includes the cases of finding the minimum, maximum, and median elements. There are worst-

在绘制的40*40的方格上，自己定义起点终点和障碍，用A*算法避开障碍物，规划出最短路径-On the paint of 40* 40 squares, define your own starting point to the end and obstacles, using A* algorithm to avoid obstacles, planning the shortest path