Performance of indexed sorted data?

Nobody has claimed this yet.

I wonder if there will be any visible difference when iterating over indexed sorted data, as instead of simple sequential reads from memory we need to jump to random places in memory to get each element. Can you maybe test if there will be any difference when iterating over all that sorted elements with some simple operation inside loop? Would be interesting if cost of accessing that data would be similar to what we saved by not sorting real data and just using indexes.

Sorry that I didn't just make a PR, but currently I don't have enough time to play with this, especially that C# isn't my language so it will take some time for me to find and learn some good benchmark tools for this language.

No file, test, or entry point is named. Start by locating the code that iterates indexed sorted data in the SortOfProblem demo, then establish a repeatable C# benchmark comparing indexed iteration with sorting and sequential iteration; done means recording whether access costs offset the avoided sort.

Written by the indexing model from the issue text.