title: What's this sorting algorithm called?
body: <p>I am thinking about a non-comparison sorting algorithm and I think I've found one myself.</p>
  
  <pre><code>Input: A[0...n] ranged from 0...n //ideally, I think it can be expanded to more general case later
  
  Non-comparison-sort(A,n):
  let B = [0...n] = [0]
  for i in A:
      B[A[i]]=i
  </code></pre>
  
  <p>After this algorithm,each element in array B will have a reference to array A and say if we want to access A[k] whose value is m, we can use A[B[m]]</p>
  
  <p>I am sure I am not the first one come across this idea, So my question is what is this algorithm called?</p>
  
  <p>Thanks in advance.</p>