Hi, I need to sort about 50 lists (each about 500 elements) together, using few of them as keys. That is, sort the key lists first; look at which indexes have changed; then, shuffle the rest of list to reflect this new order. Does anyone know a fast fast routine for doing this? ---William Park, Open Geometry Consulting