No,

Suppose the array is already sorted in ascending order then the no. of comparisons made is O(n) which is the best case of bubble sort but the number of inversions is 0 (zero) in that case.

May be the number of swaps needed in bubble sort = no. of inversions present in the array.

Suppose the array is already sorted in ascending order then the no. of comparisons made is O(n) which is the best case of bubble sort but the number of inversions is 0 (zero) in that case.

May be the number of swaps needed in bubble sort = no. of inversions present in the array.