I seem to remember that, for certain index types (paged B+ I think), an ordered insert is the worst-case scenario (i.e. results in the worst performance) resulting in a wildly imbalanced 'tree' so that instead of (say) four disc accesses to reach any record, you must make a much larger number.

You could test this by NOT inserting in order, or you could delete the key and re-create it after all the inserts.


P.s. is it Worst-case or worse-case?