algorithms – inversions in array

If the worst case arrays {5 4 3 2 1} have number of inversions as Θ(n^2) => n(n-1)/2 swaps
The best case arrays {1 2 3 4 5} have number of inversions 0(no swap)

What kind of arrays have number of inversions Θ(n)?

{2 1 3 4 5} can this be an array with number of inversions Θ(n) as there will be only 1 swap.