<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Snipplr</title>
<link>http://snipplr.com/language/c/tags/binary</link>
<description>Recent snippets posted on Snipplr.com</description>
<language>en-us</language>
<pubDate>Tue, 21 May 2013 03:36:07 GMT</pubDate>
<item>
<title>(C) Two Binary Search Functions in C - rtperson</title>
<link>http://snipplr.com/view/63046/two-binary-search-functions-in-c/</link>
<description><![CDATA[ <p>Two versions of binary search -- one recursive, one iterative -- for an array of strings.
Both assume that your array index fits within an integer.</p> ]]></description>
<pubDate>Sat, 04 Feb 2012 02:45:29 GMT</pubDate>
<guid>http://snipplr.com/view/63046/two-binary-search-functions-in-c/</guid>
</item>
<item>
<title>(C) convert int to binary in c - zava</title>
<link>http://snipplr.com/view/38251/convert-int-to-binary-in-c/</link>
<description><![CDATA[ <p></p> ]]></description>
<pubDate>Tue, 03 Aug 2010 04:09:07 GMT</pubDate>
<guid>http://snipplr.com/view/38251/convert-int-to-binary-in-c/</guid>
</item>
<item>
<title>(C) Binary GCD - s1m55r</title>
<link>http://snipplr.com/view/36332/binary-gcd/</link>
<description><![CDATA[ <p>Compute the GCD of two numbers</p> ]]></description>
<pubDate>Fri, 25 Jun 2010 18:46:42 GMT</pubDate>
<guid>http://snipplr.com/view/36332/binary-gcd/</guid>
</item>
<item>
<title>(C) Calculate binomial coefficient - s1m55r</title>
<link>http://snipplr.com/view/36143/calculate-binomial-coefficient/</link>
<description><![CDATA[ <p>Program to calculate large binomial coefficients efficiently. As long as the value fits into an unsigned long long int, the program should find it in a relatively short amount of time.</p> ]]></description>
<pubDate>Fri, 25 Jun 2010 05:48:40 GMT</pubDate>
<guid>http://snipplr.com/view/36143/calculate-binomial-coefficient/</guid>
</item>
</channel>
</rss>