<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Snipplr</title>
    <description>Recent snippets posted on Snipplr.com</description>
    <link>https://snipplr.com/</link>
    <lastBuildDate>Tue, 09 Jun 2026 13:43:02 +0000</lastBuildDate>
    <item>
      <title>(Haskell) Compare Binary Search Trees - u1ik</title>
      <link>https://snipplr.com/view/18987/compare-binary-search-trees</link>
      <description>&lt;p&gt;&lt;/p&gt;</description>
      <pubDate>Sat, 29 Aug 2009 05:09:30 UTC</pubDate>
      <guid>https://snipplr.com/view/18987/compare-binary-search-trees</guid>
    </item>
    <item>
      <title>(Haskell) Compare Binary Search Trees (flawed) - u1ik</title>
      <link>https://snipplr.com/view/18966/compare-binary-search-trees-flawed</link>
      <description>&lt;p&gt;Similar to merging two sorted lists. &#13;
UPT: Doesn't work.&lt;/p&gt;</description>
      <pubDate>Fri, 28 Aug 2009 13:46:17 UTC</pubDate>
      <guid>https://snipplr.com/view/18966/compare-binary-search-trees-flawed</guid>
    </item>
    <item>
      <title>(C++) Dwarves solution - u1ik</title>
      <link>https://snipplr.com/view/6924/dwarves-solution</link>
      <description>&lt;p&gt;Probably not correct, but passed tests http://www.liis.ro/~lotinfo2008/probleme/pitici.zip&lt;/p&gt;</description>
      <pubDate>Thu, 26 Jun 2008 05:30:39 UTC</pubDate>
      <guid>https://snipplr.com/view/6924/dwarves-solution</guid>
    </item>
  </channel>
</rss>
