将主程序放置上方报错函数未定义,放置下方告知demo未定义
def QuickSort(arr):
if(len(arr)<2):
return arr
else:
pivot=arr[0]
less=[i for i in arr[1:] if(i<=pivot)]
great=[i for i in arr[1:] if(i>pivot)]
return QuickSort(less)+[pivot]+QuickSort(great)
def Search(arr):
for i in range(len(arr)):
if i==flag:
print(i)
else:
demo = -1
break
list=list(map(int,input().split(' ')))
flag=int(input())
print(QuickSort(list))
Search(list)