Let A[l..n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A.
a) Show the insertion sort algorithm. Explain clearly how it works.
b) Modify the insertion sort algorithm to count the number of inversions in the input array.
c) Trace your algorithm for question b above as it counts the number of inversions in this array: [40, 30, 20, 10].

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

a) In pseudo-code, the Insertion Sort algorithm can be represented like below (two nested loops):

for j = 1 to array.size do
{aux= array[j]    //temporary variable used for swapping the compared items
                   //the item array[j] is inserted into sorted sub-array array[1 . . j − 1]
                   i = j − 1   
                   While (i > 0) and (array[i] > aux) do
                                 {array[i +1] = array[i]...

By purchasing this solution you'll be able to access the following files:

for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Data Structures and Algorithms Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Upload a file
Continue without uploading

We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats