我希望实现一个选择排序算法来对未排序的列表/数组进行排序,这是我目前得到的结果:
list1 = [14,3,2,21,23,12,3,4]#unsorted array
z = 3
for i in range(len(list1)):
for j in range(i, len(list1)):
if list1[i] < list1[j]:
list1[i], list1[j] = list1[j], list1[i]
print(list1)
我面临的问题是如何得到z‘to最高的项目。即,打印直到索引z为止的最高项
也应
以下是我的脚本的前提条件
"Generate a string with N opening brackets ("[") and N closing brackets ("]"), in some
arbitrary order. You will need to use random numbers.
Determine whether the generated string is balanced; that is, whether it consists entirely of
pairs of opening/closing