We help IT Professionals succeed at work.
Get Started

sort hash by values of two keys

aedolbey asked
Last Modified: 2012-05-10
Hello experts,

I need to sort a hash based on the values of two keys.  The hash holds pairs of numbers, where the pair is covered with keys named 'start' and 'end'.  When sorting these pairs, the problem is in dealing with cases in which the start or the end of one pair is identical with the start or end of a different pair.  For the following set of pairs, I want a sort of the hash that produces exactly this ordering:

      3:7, 10:30, 10:15, 15:25, 27:30, 35:40

The problem cases are the ones in which one of the pair parts is identical with one of the parts of a different pair (seen in tokens 2 through 5 above).  To make what I'm after a little clearer, you can think of token 2 as 'surrounding' tokens 3 through 5, or, tokens 3 through 5 are 'inside' or a subpart of token 2.

What's a good way to do this kind of sorting of a hash in Perl?

Thanks for your help.

Watch Question
Most Valuable Expert 2014
Top Expert 2015
This problem has been solved!
Unlock 2 Answers and 10 Comments.
See Answers
Why Experts Exchange?

Experts Exchange always has the answer, or at the least points me in the correct direction! It is like having another employee that is extremely experienced.

Jim Murphy
Programmer at Smart IT Solutions

When asked, what has been your best career decision?

Deciding to stick with EE.

Mohamed Asif
Technical Department Head

Being involved with EE helped me to grow personally and professionally.

Carl Webster
CTP, Sr Infrastructure Consultant
Ask ANY Question

Connect with Certified Experts to gain insight and support on specific technology challenges including:

  • Troubleshooting
  • Research
  • Professional Opinions
Did You Know?

We've partnered with two important charities to provide clean water and computer science education to those who need it most. READ MORE