Python 如何解决合并排序算法中的递归问题？

在示例中，我想使用合并排序对station的属性f进行排序

class mergesort_algorithm():


 def Merge_Sort(self,stations):

     length = len(stations)
     middle = int(length/2-1)

     if length<=1:
         return stations
     else:
         list1 = self.Merge_Sort(stations[:middle])
         list2 = self.Merge_Sort(stations[middle:])

         return self.Merge(list1,list2)




 def Merge(self,list1,list2):
     list3 = []
     length1 = len(list1)
     length2 = len(list2)
     point1 = 0
     point2 = 0


     while point1<=length1-1 and point2<=length2-1:

         if list1[point1].f<list2[point2].f:
             list3.append(list1[point1])
             point1 += 1

         else:
             list3.append(list2[point2])
             point2 += 1

     if point1>length1:
         for i in range(list2):
             if i>=point2:
                 list3.append(list2[point2])

     if point2>length2:
         for i in range(list1):
             if i>=point1:
                 list3.append(list1[point1])

     for item in list3:
         print(item.name)
     print("-----")
     return list3

我不知道怎么解决它。似乎有这么多的递归。我找到了一些解决方案：

---

导入系统和系统设置递归限制（1000000）

假设

len（站）

为2。然后

middle

为0。所以

stations[：middle]

是空的，但是

stations[middle:

有长度2，并且有一个无限的递归。

你如何调用这个代码？middle应该是

middle=len（stations）//2#查找数组的middle

就像在其他@mkrieger1中一样有点复杂，这是我项目中的一个函数。谢谢！我以前没想过这个案子！

File "/home/surface/Final-Year-Project/FYP/Util/Mergesort_algorithm.py", line 16, in Merge_Sort
    list1 = self.Merge_Sort(stations[:middle])
  File "/home/surface/Final-Year-Project/FYP/Util/Mergesort_algorithm.py", line 17, in Merge_Sort
    list2 = self.Merge_Sort(stations[middle:])
  File "/home/surface/Final-Year-Project/FYP/Util/Mergesort_algorithm.py", line 17, in Merge_Sort
    list2 = self.Merge_Sort(stations[middle:])
  File "/home/surface/Final-Year-Project/FYP/Util/Mergesort_algorithm.py", line 17, in Merge_Sort
    list2 = self.Merge_Sort(stations[middle:])
  [Previous line repeated 989 more times]
  File "/home/surface/Final-Year-Project/FYP/Util/Mergesort_algorithm.py", line 16, in Merge_Sort
    list1 = self.Merge_Sort(stations[:middle])
  File "/home/surface/Final-Year-Project/FYP/Util/Mergesort_algorithm.py", line 11, in Merge_Sort
    middle = int(length/2-1)
RecursionError: maximum recursion depth exceeded while calling a Python object