<?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 21:29:13 +0000</lastBuildDate>
    <item>
      <title>(Java) Scaling Values into a range between 0 and 1 - rtperson</title>
      <link>https://snipplr.com/view/66636/scaling-values-into-a-range-between-0-and-1</link>
      <description>&lt;p&gt;You have to use float or double for the returned value, since the scale occurs in a continuous function.&lt;/p&gt;</description>
      <pubDate>Fri, 10 Aug 2012 11:35:33 UTC</pubDate>
      <guid>https://snipplr.com/view/66636/scaling-values-into-a-range-between-0-and-1</guid>
    </item>
    <item>
      <title>(Java) Quicksort in Java, with Enforced Suckitude - rtperson</title>
      <link>https://snipplr.com/view/64808/quicksort-in-java-with-enforced-suckitude</link>
      <description>&lt;p&gt;It's no fun implementing QuickSort unless you can force it out of its blister-fast, O(n log n) speed and humiliate it with its worst-case, O(n^2) runtime. So that's what I set out to do.  &#13;
&#13;
My naive partition simply pivots around the low item, but my randomized partition defeats the sucky inputs by choosing a random pivot. (If you're interested in checking out a QuickSort which naively partitions until it hits an attempt to get it to run in quadratic time, check out IntroSort -- which simply  fails over to Merge Sort when it exceeds its optimal recursion depth.)&lt;/p&gt;</description>
      <pubDate>Tue, 08 May 2012 00:02:25 UTC</pubDate>
      <guid>https://snipplr.com/view/64808/quicksort-in-java-with-enforced-suckitude</guid>
    </item>
  </channel>
</rss>
