银河出逃时 2021-02-07 09:28 采纳率: 85.7%
浏览 21
已采纳

Python递归函数实现列表的二分查找代码出错该怎么改

# 使用递归函数实现列表的二分查找


def seek(n,list,l = 0,r = len(list) - 1):


    while l <= r:


        mid = (l+r)//2


        if list[mid] > n:


            return seek(n,list,l = 0,r = mid - 1)


        elif list[mid] < n:


            return seek(n,list,l = mid + 1,r = len(list) - 1 )


        else:


            break


    print(mid)


seek(47,[4,11,23,34,47,56,75,88,98,102,122,135],l = 0,r = len(list) - 1 )


# TypeError: object of type 'type' has no len()

请在此代码上修改,错误已附在最后注释里,最后要输出查找结果!

新手求大佬指点!感谢!

  • 写回答

2条回答 默认 最新

  • 临地 2021-02-07 09:41
    关注
    # 使用递归函数实现列表的二分查找
    def seek(n, list, l, r):
        while l <= r:
            mid = (l + r) // 2
            if list[mid] > n:
                return seek(n, list, l, mid - 1)
            elif list[mid] < n:
                return seek(n, list, mid + 1, r)
            else:
                break
        print(mid)
    
    
    list = [4, 11, 23, 34, 47, 56, 75, 88, 98, 102, 122, 135]
    seek(47, list, 0, len(list) - 1)
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?