Python 冒泡排序递归。我究竟做错了什么？

Question

我正在为 class 进行递归分配。我了解如何使用该公式，但我相信我在正确打印字典方面做错了。有人可以帮我弄清楚如何获得正确的输出吗？

[('4213', 'STEM Center', 0), ('4201', 'Foundations Lab', 1), ('4204', 'CS Lab', 2), ('4218', 'Workshop Room', 3), ('4205', 'Tiled Room', 4), ('Out', 'Outside', 5)]
[('4201', 'Foundations Lab', 1), ('4204', 'CS Lab', 2), ('4205', 'Tiled Room', 4), ('4213', 'STEM Center', 0), ('4218', 'Workshop Room', 3), ('Out', 'Outside', 5)]
[('4204', 'CS Lab', 2), ('4201', 'Foundations Lab', 1), ('Out', 'Outside', 5), ('4213', 'STEM Center', 0), ('4205', 'Tiled Room', 4), ('4218', 'Workshop Room', 3)]
[('4204', 'CS Lab', 2), ('4201', 'Foundations Lab', 1), ('Out', 'Outside', 5), ('4213', 'STEM Center', 0), ('4205', 'Tiled Room', 4), ('4218', 'Workshop Room', 3)]

相反，我得到：

[('4213', 'STEM Center', 0), ('4218', 'Workshop Room', 3), ('4201', 'Foundations Lab', 1), ('4205', 'Tiled Room', 4), ('4204', 'CS Lab', 2), ('out', 'Outside', 5)]

None None

我已经搞清楚了。

def recursiveSort(sensor_list,n,t): #Recursive Sort
if n == 0:
    return sensor_list
    for i in range(n-1):
        if sensor_list[i][t] > sensor_list[i + 1][t]:
        temp = sensor_list[i]
        sensor_list[i] =sensor_list[i + 1]
        sensor_list[i + 1] = temp

return recursiveSort(sensor_list,n - 1,t)

Dict = {'4213' : ('STEM Center', 0),
'4201' : ('Foundations Lab', 1),
'4204' : ('CS Lab', 2),
'4218' : ('Workshop Room', 3),
'4205' : ('Tiled Room', 4),
'out' :  ('Outside', 5),
}

sensor_list=[]

[ sensor_list.append((key,Dict[key][0],Dict[key][1])) for key in Dict ] #Adding values to a dictionary into a tuple using list comprehension

print sensor_list


print recursiveSort(sensor_list,len(sensor_list),0)

print recursiveSort(sensor_list,len(sensor_list),1)

print sensor_list

Answer 1

我运行像下面这样正确缩进的代码得到了正确的输出。

def recursiveSort(sensor_list,n,t): #Recursive Sort
    if n == 0:
        return sensor_list
    for i in range(n-1):
        if sensor_list[i][t] > sensor_list[i + 1][t]:
            temp = sensor_list[i]
            sensor_list[i] =sensor_list[i + 1]
            sensor_list[i + 1] = temp

    return recursiveSort(sensor_list,n - 1,t)

Dict = {'4213' : ('STEM Center', 0),
'4201' : ('Foundations Lab', 1),
'4204' : ('CS Lab', 2),
'4218' : ('Workshop Room', 3),
'4205' : ('Tiled Room', 4),
'out' :  ('Outside', 5),
}

sensor_list=[]

[sensor_list.append((key,Dict[key][0],Dict[key][1])) for key in Dict ] #Adding values to a dictionary into a tuple using list comprehension

print sensor_list


print recursiveSort(sensor_list,len(sensor_list),0)

print recursiveSort(sensor_list,len(sensor_list),1)

print sensor_list

根据你得到的输出，我认为错误是for循环的缩进不正确。很可能是这样的。

if n == 0:
    return sensor_list
    for i in range(n-1):
        if sensor_list[i][t] > sensor_list[i + 1][t]:
            temp = sensor_list[i]
            sensor_list[i] =sensor_list[i + 1]
            sensor_list[i + 1] = temp

for 循环根本没有被执行，因为，

当n == 0时，因为return语句在循环之前
当 n != 0 时，因为 for 循环部分在 if 块内。

而且您的 return recursiveSort(sensor_list,n - 1,t) 语句可能也没有缩进。

Answer 2

def recursiveSort(sensor_list,n,t): #Recursive Sort
if (n == 0):

    return sensor_list
else:
    for i in range(n-1):
        if sensor_list[i][t] > sensor_list[i + 1][t]:
            temp = sensor_list[i]
            sensor_list[i] =sensor_list[i + 1]
            sensor_list[i + 1] = temp


    return recursiveSort(sensor_list,n - 1,t)

      Dict = {'4213' : ('STEM Center', 0),
    '4201' : ('Foundations Lab', 1),
   '4204' : ('CS Lab', 2),
    '4218' : ('Workshop Room', 3),
   '4205' : ('Tiled Room', 4),
       'out' :  ('Outside', 5),
   }

    sensor_list=[]

       [ sensor_list.append((key,Dict[key][0],Dict[key][1])) for key in Dict ] #Adding 
      values to a dictionary into a tuple using list comprehension

     print(sensor_list)


    print recursiveSort(sensor_list,len(sensor_list),0)

   print recursiveSort(sensor_list,len(sensor_list),1)

   print sensor_list

Python 冒泡排序递归。我究竟做错了什么？

Python Bubble sort recursion. What am I doing wrong?

python

recursion

dictionary

bubble-sort