How do I sort the flattened list to match the structure of the original list? Each one has 430 items so they should sync up perfectly.
I have the key figured out (varying branch lengths from 8 down to 2) but am stuck beyond that. I want them to match the data structure of {0,0}, {0,1}, {1,0}, {1,1} and so on… like the original.
Should be a pretty simple solution but for some reason, I’m completely puzzled. Would appreciate help in achieving this. Thanks!
sorting_list_problem.gh (145.6 KB)