标准二分查找代码

二分查找算法在各种场合下经常会用到,在此总结一下它的标准代码。

代码

int binary_search(int array[], int n, int value)
{
	int left = 0;
	int right = n - 1;

	while (left <= right)
	{
		int mid = (left + right) >> 1;

		if (array[mid] < value)
			left = mid + 1;
		else if (array[mid] > value)
			right = mid + 1;
		else
			return mid;
	}

	return -1;
}

参考

http://blog.csdn.net/v_july_v/article/details/7093204

本文章迁移自http://blog.csdn.net/timberwolf_2012/article/details/40477343

/** * RECOMMENDED CONFIGURATION VARIABLES: EDIT AND UNCOMMENT THE SECTION BELOW TO INSERT DYNAMIC VALUES FROM YOUR PLATFORM OR CMS. * LEARN WHY DEFINING THESE VARIABLES IS IMPORTANT: https://disqus.com/admin/universalcode/#configuration-variables*/ /* var disqus_config = function () { this.page.url = PAGE_URL; // Replace PAGE_URL with your page's canonical URL variable this.page.identifier = PAGE_IDENTIFIER; // Replace PAGE_IDENTIFIER with your page's unique identifier variable }; */ (function() { // DON'T EDIT BELOW THIS LINE var d = document, s = d.createElement('script'); s.src = 'https://chenzz.disqus.com/embed.js'; s.setAttribute('data-timestamp', +new Date()); (d.head || d.body).appendChild(s); })();