853 views
0 votes
0 votes
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 ?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
ankitgupta.1729 asked Nov 9, 2017
579 views
How to get number of Inversion count using merge sort?
0 votes
0 votes
1 answer
2
Himanshu1 asked Dec 16, 2015
698 views
A) 192 B) 120 c) 188 D) 176
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Jun 26, 2019
209 views
Give an algorithm that determines the number of inversions in any permutation on $n$ elements in $\Theta (n\ lg\ n)$ worst-case time. (Hint: Modify merge sort.)
0 votes
0 votes
0 answers
4
akash.dinkar12 asked Jun 26, 2019
152 views
What is the relationship between the running time of insertion sort and the number of inversions in the input array? Justify your answer.