Question: 3. (25 points) Let A[1..] be an array of n distinct numbers. If i A, the pair (i,j) is called an inversion of A. (a)

3. (25 points) Let A[1..] be an array of n distinct numbers. If i A, the pair (i,j) is called an inversion of

3. (25 points) Let A[1..] be an array of n distinct numbers. If i A, the pair (i,j) is called an inversion of A. (a) List all the inversions of the array(2,3, 8,6, l). b) What array with elements from the set 1,2,n has the most inversions How many does it have? (c) What is the relationship between the running time of INSERTION SORT (see question 2) and the ns in the input array? Justify your answer. (d) Suppose we are comparing implementations of insertion sort and merge sort (a more advanced sorting algorithm, which we will learn about later in the semester) on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64n log2n steps. For which values of n does insertion sort beat merge sort

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

(30 points) Let A[1...n] be an array of n distinct numbers (i.e., no two numbers are equal). If i A[j], then the pair (A[i], A[j]) is called an inversion of A. (a) List all inversions of the array...

Problem 4(5+6+20 points ) Let A[1,,n] be an array of n distinct numbers. If i A[j], then the pair (i,j) is called a reverse pair for A. (a) List the five reverse pairs of the array A=[2,3,8,6,1]. (b)...

Question 3: [30 points] Inversions: An important part of sorting, higher the number of inversions, longer the run time to sort the elements) Given any list of n numbers, there are pairs of numbers as...

(20) Let A[1n] be an array of n distinct numbers. If i A[j], then the pair (i, j) is called an inversion of A. (2) List the five inversions of the array A = {2, 3, 8, 6, 1} (3) What...

1. Use indicator random variables to compute the expected value of the sum of n dice. You can assume that all n dice are fair and the rolling of each die is independent with other rolling. 2. Each of...

2. Inversions. Let A[1..n] be an array of n distinct numbers. If i A[j], then the pair (i, j) is called an inversion of A. (a) List the five inversions of the array ....

1. Insertion-sort can be expressed as a recursive procedure as follows. In order to sort A[1..n], we recur- sively sort A[1..n 1] and then insert A[n] into the sorted array A[1..n 1]. (a) Describe...

2. Introduction This programming assignment is meant for practicing recursion, and this document will guide you to the final solution. Description of problem Alice and Bob saw an interesting matrix...

8. (15 points) Let A[0...n-1) be an array of n integer numbers. Assume that all the numbers are distinct. In the array, a pair of two numbers (A[i], 4[]) is called an inversion if i 46). (a) Assume...

Two discount airlines, FlyRite and BudJet, consider expanding their operations to a particular new route. Unfortunately, they will lose money if both decide to fly the same route. Their expected...

Expose Company specializes in the repair of music equipment and is owned and operated by Gavin Staub. On June 30, 2006, the end of the current year, the accountant for Expose Company prepared the...

In today's international currency exchange markets, the U.S. dollar can purchase 20,000 Vietnamese dong, while the Azeri manat sells for 12,000 dong. If you have 1 million manat, how many dollars...

8:37 * N. 80% i ... OBJECTIVES: Create relationships Create a Pivot Table from Related Tables Create a PivotChart Modify the PivotChart The major section in this chapter :ontinuation is: Data...