<?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/haskell/tags/compare</link>
<description>Recent snippets posted on Snipplr.com</description>
<language>en-us</language>
<pubDate>Sun, 19 May 2013 08:02:47 GMT</pubDate>
<item>
<title>(Haskell) Compare Binary Search Trees - u1ik</title>
<link>http://snipplr.com/view/18987/compare-binary-search-trees/</link>
<description><![CDATA[ <p></p> ]]></description>
<pubDate>Sat, 29 Aug 2009 05:09:30 GMT</pubDate>
<guid>http://snipplr.com/view/18987/compare-binary-search-trees/</guid>
</item>
<item>
<title>(Haskell) Compare Binary Search Trees (flawed) - u1ik</title>
<link>http://snipplr.com/view/18966/compare-binary-search-trees-flawed/</link>
<description><![CDATA[ <p>Similar to merging two sorted lists. 
UPT: Doesn't work.</p> ]]></description>
<pubDate>Fri, 28 Aug 2009 13:46:17 GMT</pubDate>
<guid>http://snipplr.com/view/18966/compare-binary-search-trees-flawed/</guid>
</item>
</channel>
</rss>