A while back I did some rough tests on search of arrays in depth first order. The hope was that the better contiguity (the next element in the array is the next element to test 50% of the time) would lead to better search performance, but I wasn't able to observe much of a difference in practice.
I also found that while writing the search operation was very easy for arrays in this order, insertion was much more difficult.
A while back I did some rough tests on search of arrays in depth first order. The hope was that the better contiguity (the next element in the array is the next element to test 50% of the time) would lead to better search performance, but I wasn't able to observe much of a difference in practice.
I also found that while writing the search operation was very easy for arrays in this order, insertion was much more difficult.