Hi Dieter,

in general, you need to count _all_ operations and then take the one with the highest time complexity.

But in this specific case, there must be at least one comparison for each swap, so the time complexity for swaps can't be higher than for comparisons.

Therefore, you're right, determining the time complexity for comparisons is enough!

thanks for the article. It was very helpful.
A question:
For the counting of complexity do you count comparing or swapping operation?
To count comparisons should be enough, right?