title: Hash Function with Order Preserving
body: <p>Is there any hash function with uniq hash code (like MD5) with order preserving?</p>
  
  <p>NOTE:
  i don't care about security, i need it for sorting, i have lot of chunks with (~1MB size) and i want to sort them, of course i can use index sort but i want to reduce time of compare</p>
  
  <p>Theoreticaly:
  if i have 1'000'000 chunks with 1MB size (1'048'576 byte) and all of them have difference in last 10 bytes then time of compare of one chunk to other will be O(n-10) and if i will use QuictSort (which make ~(n<em>log2(n)) compares) then total time of compare will be n</em>log2(n)*(k-10) (where k is chunk size)
  1'000'000 * 20 * (1'048'576 - 10)</p>
  
  <p>that's why i want to generate order preserved hash codes  with fixed size (for example 16 bytes) once then sort chunks and save result (for example: in file)</p>