<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: Algorithm Cheatsheet: Radix Sort</title>
	<atom:link href="/2012/03/20/algorithm-cheatsheet-radix-sort/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/03/20/algorithm-cheatsheet-radix-sort/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: Chad Brewbaker</title>
		<link>/2012/03/20/algorithm-cheatsheet-radix-sort/comment-page-1/#comment-15332</link>
		<dc:creator><![CDATA[Chad Brewbaker]]></dc:creator>
		<pubDate>Wed, 21 Mar 2012 16:46:36 +0000</pubDate>
		<guid isPermaLink="false">/?p=2937#comment-15332</guid>
		<description><![CDATA[It also works with IEEE floats. You just have to do some bit twiddling on the exponent, then consume the mantissa. Even on bat crazy architectures like the VAX where the mantissa wraps around back to the front you can adapt radix sort to work.

http://stereopsis.com/radix.html

Radix sort is an elegant class of algorithms for sorting elements from a fixed length bit sequence.]]></description>
		<content:encoded><![CDATA[<p>It also works with IEEE floats. You just have to do some bit twiddling on the exponent, then consume the mantissa. Even on bat crazy architectures like the VAX where the mantissa wraps around back to the front you can adapt radix sort to work.</p>
<p><a href="http://stereopsis.com/radix.html" rel="nofollow">http://stereopsis.com/radix.html</a></p>
<p>Radix sort is an elegant class of algorithms for sorting elements from a fixed length bit sequence.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
