sort a sorted internal table
If an internal table is sorted or almost sorted, if we sort it again, does it take the same time as it is not sorted at all?
I ask this question because sometimes you do some modifies on a long code which is written by others, you don't want to read the entire code but you need a sorted internal table. If sort a sorted table doesn't take too much time, then I can singly put a SORT before entering LOOP.
Otherwise I have to read the all code to make sure the internal table is sorted only once.