title: Can you sort n integers in O(n) amortized complexity?
body: <p>Is it theoretically possible to sort an array of n integers in an amortized complexity of O(n)?</p>
  
  <p>What about trying to create a worst case of O(n) complexity?</p>
  
  <p>Most of the algorithms today are built on O(nlogn) average + O(n^2) worst case.
  Some, while using more memory are O(nlogn) worst.</p>
  
  <p>Can you with no limitation on memory usage create such an algorithm?
  What if your memory is limited? how will this hurt your algorithm?</p>