The number of inversions I(L) in a list L isthe number of pairs of elements x, y such that xcomes before y in L, but x > y. Showthat bubble sort does not run in O(n+I(L))time.
Expert Answer
An answer will be send to you shortly. . . . .
The number of inversions I(L) in a list L isthe number of pairs of elements x, y such that xcomes before y in L, but x > y. Showthat bubble sort does not run in O(n+I(L))time.
An answer will be send to you shortly. . . . .