Thank you, yes, I'm aware of the Big O notation (never knew to call it that though LOL) and like I said I could guess at it's usage. In the context I was familiar with, you classify the error of your calculations as O(h), where h is the stepsize of your numerical integrator. I think n-order runke-kutta has cuttoff errror on the Order O(h^(n+1)); hence I my initial confusion.

What I'm trying to get at is that sorting constraints is only one factor in a PE; thus how much faster one sorts than the other is one factor. The actual numerical algorythem's used are just as important when you want to compare one engines performance next to another.

All that aside, please note that on the Newton forums, they are quoted with going for "accuracy over speed", thus, wouldn't it be the 3DGS PE that is the overall faster beast??

Or is it? Like I said, I've never programmed a PE....