Is it always the case that in an unsorted array using comparison based sorting algorithm the minimum number of comparison required to convert it into sorted array is Equal to number of Inversions present in the Array. Am i saying the statement right ?