Write the following variant of insertion sort. // The function gets an array of length n of ints, // and applies the Insertion Sort algorithm on the array. // The function returns the array of ints of length n // where output [i] contains the number of swaps // made by the algorithm in the i'th iteration of the outer loop int* insertion_sort(int* array, int n); For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows: - Insert 4: [4,3,6,1,2,5]: 0 swaps - Insert 3: [3,4,6,1,2,5]: 1 swaps - Insert 6: [3,4,6,1,2,5]: 0 swaps - Insert 1: [1,3,4,6,2,5]: 3 swaps - Insert 2: [1,2,3,4,6,5]: 3 swaps - Insert 5: [1,2,3,4,5,6]: 1 swaps After the execution of the function (1) A will become [1,2,3,4,5,6] (2) the function returns [0,1,0,3,3,1].
Write the following variant of insertion sort. // The function gets an array of length n of ints, // and applies the Insertion Sort algorithm on the array. // The function returns the array of ints of length n // where output [i] contains the number of swaps // made by the algorithm in the i'th iteration of the outer loop int* insertion_sort(int* array, int n); For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows: - Insert 4: [4,3,6,1,2,5]: 0 swaps - Insert 3: [3,4,6,1,2,5]: 1 swaps - Insert 6: [3,4,6,1,2,5]: 0 swaps - Insert 1: [1,3,4,6,2,5]: 3 swaps - Insert 2: [1,2,3,4,6,5]: 3 swaps - Insert 5: [1,2,3,4,5,6]: 1 swaps After the execution of the function (1) A will become [1,2,3,4,5,6] (2) the function returns [0,1,0,3,3,1].
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
Related questions
Question
![Write the following variant of insertion sort.
// The function gets an array of length n of ints,
// and applies the Insertion Sort algorithm on the array.
// The function returns the array of ints of length n
// where output [i] contains the number of swaps
// made by the algorithm in the i'th iteration of the outer loop
int* insertion_sort (int* array, int n);
For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows:
- Insert 4: [4,3,6,1,2,5]: 0 swaps
- Insert 3: [3,4,6,1,2,5]: 1 swaps
- Insert 6: [3,4,6,1,2,5]: 0 swaps
- Insert 1: [1,3,4,6,2,5]: 3 swaps
- Insert 2: [1,2,3,4,6,5]: 3 swaps
- Insert 5: [1,2,3,4,5,6]: 1 swaps
After the execution of the function
(1) A will become [1,2,3,4,5,6]
(2) the function returns [0,1,0,3,3,1].](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd4d1350d-1c9d-4d27-bfd0-605ff64c4314%2F5211c7fc-cd90-4554-91b7-a20ae4192181%2F7023fvd_processed.png&w=3840&q=75)
Transcribed Image Text:Write the following variant of insertion sort.
// The function gets an array of length n of ints,
// and applies the Insertion Sort algorithm on the array.
// The function returns the array of ints of length n
// where output [i] contains the number of swaps
// made by the algorithm in the i'th iteration of the outer loop
int* insertion_sort (int* array, int n);
For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows:
- Insert 4: [4,3,6,1,2,5]: 0 swaps
- Insert 3: [3,4,6,1,2,5]: 1 swaps
- Insert 6: [3,4,6,1,2,5]: 0 swaps
- Insert 1: [1,3,4,6,2,5]: 3 swaps
- Insert 2: [1,2,3,4,6,5]: 3 swaps
- Insert 5: [1,2,3,4,5,6]: 1 swaps
After the execution of the function
(1) A will become [1,2,3,4,5,6]
(2) the function returns [0,1,0,3,3,1].
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education