title: An array of length N can contain values 1,2,3 ... N^2. Is it possible to sort in O(n) time?
body: <p>Given an array of length N. It can contain values from ranging from 1 to N^2 (N squared) both inclusive, values are integral. Is it possible to sort this array in O(N) time? If possible how?</p>
  
  <p>Edit: This is not a homework.</p>