Calculating orbits.

[Jjagg]

Maybe try the test with a struct holding the data instead of a class.

[GeonBit]

@Dismiss

The only other factor I can think of that we haven’t already discussed is the cost of doing ‘out of bounds’ testing on each indexer operation. A linked list doesn’t have that overhead.

Didn’t understand exactly what you mean here, but I think I’m done with these tests… Feel free to continue, all the code is dumped in this thread.

@Dismiss

(note: to compare an actual ‘tree’ not a linked list, there would need to be more than one child per item (min two or its not a tree)).

Agree, but for this experiment it should not matter. Or is it?.. O.o

@Jjagg

Maybe try the test with a struct holding the data instead of a class.

Tried it already here Calculating orbits. - #17 by GeonBit

[Dismiss]

Conclusion: the general rule is, general rules don’t work nearly as well as running a real profiler on your real code.