Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8463159
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 10, 20262026-06-10T14:23:22+00:00 2026-06-10T14:23:22+00:00

How can I sort an array with all children after their respective parents? I

  • 0

How can I sort an array with all children after their respective parents? I guess I’m trying to store a tree inside a one-dimensional array. I have tried to figure this out using usort, but I don’t think it is the right tool for the job.

Example input array:

array (0 => array ( 'id' => '1', 'parent' => '0', ), 
1 => array ( 'id' => '2', 'parent' => '1', ), 
2 => array ( 'id' => '3', 'parent' => '0', ), 
3 => array ( 'id' => '5', 'parent' => '0', ), 
4 => array ( 'id' => '17', 'parent' => '3', ), 
5 => array ( 'id' => '31', 'parent' => '2', ), 
6 => array ( 'id' => '32', 'parent' => '2', ))

Example output:

Array sorted according to the description

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-10T14:23:24+00:00Added an answer on June 10, 2026 at 2:23 pm

    Start by building an actual tree, then flatten that tree:

    $array = array (0 => array ( 'id' => '1', 'parent' => '0', ),
                    1 => array ( 'id' => '2', 'parent' => '1', ),
                    2 => array ( 'id' => '3', 'parent' => '0', ),
                    3 => array ( 'id' => '5', 'parent' => '0', ),
                    4 => array ( 'id' => '17', 'parent' => '3', ),
                    5 => array ( 'id' => '31', 'parent' => '2', ),
                    6 => array ( 'id' => '32', 'parent' => '2', ));
    
    /* Building a tree. We also save a map of references to avoid                                
       searching the tree for nodes */
    
    //Helper to create nodes                                                                     
    $tree_node = function($id, $parent) {
      return array('id' => $id, 'parent' => $parent, 'children' => array());
    };
    
    $tree = $tree_node(0, null); //root node                                                     
    $map = array(0 => &$tree);
    foreach($array as $cur) {
      $id = (int) $cur['id'];
      $parentId = (int) $cur['parent'];
      $map[$id] =& $map[$parentId]['children'][];
      $map[$id] = $tree_node($id, $parentId);
    }
    
    //Now recursively flatten the tree:                                                          
    function flatter($node) {
      //Create an array element of the node                                            
      $array_element = array('id' => (string) $node['id'],
                             'parent' => (string) $node['parent']);
      //Add all children after me                                                                
      $result = array($array_element);
      foreach($node['children'] as $child) {
        $result = array_merge($result, flatter($child));
      }
      return $result;
    }
    
    $array = flatter($tree);
    array_shift($array); //Remove the root node, which was only added as a helper                
    
    print_r($array);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm trying to sort a multidimensional array in objective-c i know that i can
How can I sort an array based on two specific values within the array?
How can I sort this array by the value of the "order" key? Even
How can I sort a 2D array in PHP. I want to sort on
I need to sort an array that can look like this: $array[4][0] = array('id'
To access the array indice at the xth position we can use some sort
I have been trying to create a ListView which I can sort using drag
Is there away i can sort the following array into the correct order? Array
I'm trying to pre-sort an array of items are added into an array using
How can I return a list/array of all keys that have an error? I

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.