The process of performing swaps via a cycle detection method can indeed be done in O(n). However, determining the sorted order using a general comparison-based algorithm will typically be O(nlogn) only ig. Therefore, unless you make additional assumptions (e.g., a limited range of values), the overall algorithm will be dominated by the sorting phase (O(nlogn)) rather than the swap phase (O(n)).

So ig nlogn