Or you could have an actual nested tree e.g
my %tree = ( "Office of President" => { Recruiting => undef, 'Pipe line' => undef, Software => { MIS => undef, 'System Operations' => undef, }, } ); print dump_tree(\%tree); sub dump_tree { my($tree, $indent) = ( $_[0], $_[1] || 0 ); my $ret = ''; for(sort keys %$tree) { $ret .= " " x $indent."$_\n"; $ret .= dump_tree($tree->{$_}, $indent + 2) if ref $tree->{$_} and ref $tree->{$_} eq 'HASH'; } return $ret; } __output__ Office of President Pipe line Recruiting Software MIS System Operations
Which, as you can see, lends itself to a nice recursive subroutine to dump the given tree.
HTH

_________
broquaint

update: changed code to better reflect the desired data structure


In reply to Re: Logic for sorting of this given array by broquaint
in thread Logic for sorting of this given array by ravish

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.