Sort first n integers in linear time and constant space

Question

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.

Is there an existing algorithm that fits these specifications?