title: How to sort a sparse vector fastest
body: <p>I have an integer vector. The size of the vector is around 2k, and each number in the vector is in the range of [0, 2M] and there is a high possibility to be 0.</p>
  
  <p>Since it is a sparse vector, I'm wondering if there is a better algorithm than the regular ones to sort the vector? Which sorting algorithm would be the best for this scenario?</p>
  
  <p>Thanks</p>