Is it possible to sort two lists(which reference each other) in the exact same way?
<p>Okay, this may not be the smartest idea but I was a bit curious if this is possible.  Say I have two lists:</p>

<pre><code>list1 = [3,2,4,1, 1]
list2 = [three, two, four, one, one2]
</code></pre>

<p>If I run <code>list1.sort()</code>, it'll sort it to <code>[1,1,2,3,4]</code> but is there a way to get to keep list2 in sync as well(so I can say item 4 belongs to 'three')?  My problem is I have a pretty complex program that is working fine with lists but I sort of need to start referencing some data. I know this is a perfect situation for dictionaries but I'm trying to avoid dictionaries in my processing because I do need to sort the key values(if I must use dictionaries I know how to use them).</p>

<p>Basically the nature of this program is, the data comes in a random order(like above), I need to sort it, process it and then send out the results(order doesn't matter but users need to know which result belongs to which key). I thought about putting it in a dictionary first, then sorting list one but I would have no way of differentiating of items in the with the same value if order is not maintained(it may have an impact when communicating the results to users).  So ideally, once I get the lists I would rather figure out a way to sort both lists together.  Is this possible?</p>
