title: Sort first n integers in linear time and constant space
body: <p>I'm looking for a non-comparison or comparison based algorithm that can sort an array containing any permutation of the first n positive integers, which should be O(n) time complexity and O(1) space complexity.</p>
  
  <p>Is there an existing algorithm that fits these specifications?</p>