什么是惰性二进制搜索?

本文介绍了什么是惰性二进制搜索?的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

我不知道术语惰性"二进制搜索是否有效，但是我正在阅读一些旧资料，我只是想知道是否有人可以解释惰性二进制搜索的算法并将其与非二进制搜索进行比较. -懒惰的二进制搜索.

I don't know whether the term "Lazy" Binary Search is valid, but I was going through some old materials and I just wanted to know if anyone can explain the algorithm of a Lazy Binary Search and compare it to a non-lazy Binary Search.

比方说，我们有以下数字数组:

Let's say, we have this array of numbers:

2, 11, 13, 21, 44, 50, 69, 88

如何使用惰性二进制搜索查找数字11?

How to look for the number 11 using a Lazy Binary Search?

推荐答案

据我所知，惰性二进制搜索"只是"二进制搜索".

As far as I am aware "Lazy binary search" is just another name for "Binary search".