title: Sorting integers with a binary trie?
body: <p>Since every integer can be represented as a series of bits of some length, it seems like you could sort a bunch of integers in the following way:</p>
  
  <ol>
  <li>Insert each integer into a <a href="http://en.wikipedia.org/wiki/Trie#Bitwise_tries" rel="noreferrer">binary trie</a> (a trie where each node has two children, one labeled 0 and one labeled 1).</li>
  <li>Using the <a href="http://en.wikipedia.org/wiki/Trie#Sorting" rel="noreferrer">standard algorithm for listing all words in a trie in sorted order</a>, list off all the integers in sorted order.</li>
  </ol>
  
  <p>Is this sorting algorithm ever used in practice?</p>