Insertion Sort is a simple sorting technique which was covered in previous challenges. Sometimes, arrays may be too large for us to wait around for insertion sort to finish. Is there some other way we can calculate the number of shifts an insertion sort performs when sorting an array? If  is the number of elements over which the  element of the array has to shift, then the total number of shifts will be  ... + . Example ArrayShifts[4,3,2,1][3,4,2,1]1[2,3,4,1]2[1,2,3,4]3Totalshifts=1+2+3=6 Function description Complete the insertionSort function in the editor below. insertionSort has the following parameter(s): int arr[n]: an array of integers Returns - int: the number of shifts required to sort the array Input Format The first line contains a single integer , the number of queries to perform. The following  pairs of lines are as follows: The first line contains an integer , the length of . The second line contains  space-separated integers . Constraints       Sample Input 2 5 1 1 1 2 2 5 2 1 3 1 2 Sample Output 0 4 Explanation The first query is already sorted, so there is no need to shift any elements. In the second case, it will proceed in the following way. Array: 2 1 3 1 2 -> 1 2 3 1 2 -> 1 1 2 3 2 -> 1 1 2 2 3 Moves: - 1 - 2 - 1 = 4

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Insertion Sort is a simple sorting technique which was covered in previous challenges. Sometimes, arrays may be too large for us to wait around for insertion sort to finish. Is there some other way we can calculate the number of shifts an insertion sort performs when sorting an array?

If  is the number of elements over which the  element of the array has to shift, then the total number of shifts will be  ... + .

Example

ArrayShifts[4,3,2,1][3,4,2,1]1[2,3,4,1]2[1,2,3,4]3Totalshifts=1+2+3=6

Function description

Complete the insertionSort function in the editor below.

insertionSort has the following parameter(s):

  • int arr[n]: an array of integers

Returns
int: the number of shifts required to sort the array

Input Format

The first line contains a single integer , the number of queries to perform.

The following  pairs of lines are as follows:

  • The first line contains an integer , the length of .
  • The second line contains  space-separated integers .

Constraints

  •  
  •  
  •  

Sample Input

2 5 1 1 1 2 2 5 2 1 3 1 2

Sample Output

0 4

Explanation

The first query is already sorted, so there is no need to shift any elements. In the second case, it will proceed in the following way.

Array: 2 1 3 1 2 -> 1 2 3 1 2 -> 1 1 2 3 2 -> 1 1 2 2 3 Moves: - 1 - 2 - 1 = 4
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Counting Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education