<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Algorithm on XGUGENG</title>
		<link>https://xgugeng.github.io/categories/algorithm/</link>
		<description>Recent content in Algorithm on XGUGENG</description>
		<generator>Hugo</generator>
		<language>en-US</language>
		
		
		
		
			<lastBuildDate>Fri, 03 Aug 2018 10:55:27 +0800</lastBuildDate>
		
			<atom:link href="https://xgugeng.github.io/categories/algorithm/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Binary Search for Upper Bound</title>
				<link>https://xgugeng.github.io/post/binary-search-for-upper-bound/</link>
				<pubDate>Fri, 03 Aug 2018 10:55:27 +0800</pubDate>
				<guid>https://xgugeng.github.io/post/binary-search-for-upper-bound/</guid>
				<description>&lt;p&gt;A frequent question I ask when interviewing some candidates is binary search. It cannot be more easier to write a binary search, but the variant may be challenging. For example, upper bound for the given target. When should I shrink my scope to left?&lt;/p&gt;&#xA;&lt;p&gt;This post elucidates the steps of binary search by illustrating some common mistakes and sloving a problem in LeetCode. And I will remind what should be paid more attention when doing search.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
