Write a function insertion_sort(list) that take a list and sort it using Insertion Sort Algorithm. Print each pass or iteration. >> insertion_sort([54, 26, 93, 17, 77, 31, 44, 55, 20]) [26, 54, 93, 17, 77, 31, 44, 55, 20] [26, 54, 93, 17, 77, 31, 44, 55, 20] [17, 26, 54, 93, 77, 31, 44, 55, 20] [17, 26, 54, 77, 93, 31, 44, 55, 20] [17, 26, 31, 54, 77, 93, 44, 55, 20] [17, 26, 31, 44, 54, 77, 93, 55, 20] [17, 26, 31, 44, 54, 55, 77, 93, 20] [17, 20, 26, 31, 44, 54, 55, 77, 93] >> insertion_sort(["Aisha", "Nadia", "Waqar", "Saleha", "Hasan", "Shahid", "Shah Jamal", "Abdullah", "Umair", "Taj"]) ['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Nadia', 'Saleha', 'Waqar', 'Hasan', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Waqar', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shahid', 'Waqar', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', "Waqar', 'Abdullah', 'Umair', 'Taj'] ['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', 'Waqar', 'Umair', 'Taj'] ['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', 'Umair', 'Waqar', 'Taj'] ['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', 'Taj', 'Umair', 'Waqar']
Write a function insertion_sort(list) that take a list and sort it using Insertion Sort Algorithm. Print each pass or iteration. >> insertion_sort([54, 26, 93, 17, 77, 31, 44, 55, 20]) [26, 54, 93, 17, 77, 31, 44, 55, 20] [26, 54, 93, 17, 77, 31, 44, 55, 20] [17, 26, 54, 93, 77, 31, 44, 55, 20] [17, 26, 54, 77, 93, 31, 44, 55, 20] [17, 26, 31, 54, 77, 93, 44, 55, 20] [17, 26, 31, 44, 54, 77, 93, 55, 20] [17, 26, 31, 44, 54, 55, 77, 93, 20] [17, 20, 26, 31, 44, 54, 55, 77, 93] >> insertion_sort(["Aisha", "Nadia", "Waqar", "Saleha", "Hasan", "Shahid", "Shah Jamal", "Abdullah", "Umair", "Taj"]) ['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Nadia', 'Saleha', 'Waqar', 'Hasan', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Waqar', 'Shahid', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shahid', 'Waqar', 'Shah Jamal', 'Abdullah', 'Umair', 'Taj'] ['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', "Waqar', 'Abdullah', 'Umair', 'Taj'] ['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', 'Waqar', 'Umair', 'Taj'] ['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', 'Umair', 'Waqar', 'Taj'] ['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid', 'Taj', 'Umair', 'Waqar']
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
python 3
![Write a function insertion_sort(list) that take a list and sort it using
Insertion Sort Algorithm. Print each pass or iteration.
>>> insertion_sort([54, 26, 93, 17, 77, 31, 44, 55, 20])
[26, 54, 93, 17, 77, 31, 44, 55, 20]
[26, 54, 93, 17, 77, 31, 44, 55, 20]
[17, 26, 54, 93, 77, 31, 44, 55, 20]
[17, 26, 54, 77, 93, 31, 44, 55, 20]
[17, 26, 31, 54, 77, 93, 44, 55, 20]
[17, 26, 31, 44, 54, 77, 93, 55, 20]
[17, 26, 31, 44, 54, 55, 77, 93, 20]
[17, 20, 26, 31, 44, 54, 55, 77, 93]
>>> insertion_sort(["Aisha", "Nadia", "Waqar", "Saleha",
"Hasan", "Shahid", "Shah Jamal", "Abdullah", "Umair", "Taj"])
['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Nadia', 'Saleha', 'Waqar', 'Hasan', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Waqar', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shahid', 'Waqar', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid',
"Waqar', 'Abdullah', 'Umair', 'Taj']
['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah
Jamal', 'Shahid', 'Waqar', 'Umair', 'Taj']
['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah
Jamal', 'Shahid', 'Umair', 'Waqar', 'Taj']
['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah
Jamal', 'Shahid', 'Taj', 'Umair', 'Waqar']](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F986abb90-c311-4611-b485-6deaa01f4c0c%2F9d77b254-9ef5-4c15-8f0b-624a935e3990%2Fnrkixf_processed.png&w=3840&q=75)
Transcribed Image Text:Write a function insertion_sort(list) that take a list and sort it using
Insertion Sort Algorithm. Print each pass or iteration.
>>> insertion_sort([54, 26, 93, 17, 77, 31, 44, 55, 20])
[26, 54, 93, 17, 77, 31, 44, 55, 20]
[26, 54, 93, 17, 77, 31, 44, 55, 20]
[17, 26, 54, 93, 77, 31, 44, 55, 20]
[17, 26, 54, 77, 93, 31, 44, 55, 20]
[17, 26, 31, 54, 77, 93, 44, 55, 20]
[17, 26, 31, 44, 54, 77, 93, 55, 20]
[17, 26, 31, 44, 54, 55, 77, 93, 20]
[17, 20, 26, 31, 44, 54, 55, 77, 93]
>>> insertion_sort(["Aisha", "Nadia", "Waqar", "Saleha",
"Hasan", "Shahid", "Shah Jamal", "Abdullah", "Umair", "Taj"])
['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Nadia', 'Waqar', 'Saleha', 'Hasan', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Nadia', 'Saleha', 'Waqar', 'Hasan', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Waqar', 'Shahid', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shahid', 'Waqar', 'Shah
Jamal', 'Abdullah', 'Umair', 'Taj']
['Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah Jamal', 'Shahid',
"Waqar', 'Abdullah', 'Umair', 'Taj']
['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah
Jamal', 'Shahid', 'Waqar', 'Umair', 'Taj']
['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah
Jamal', 'Shahid', 'Umair', 'Waqar', 'Taj']
['Abdullah', 'Aisha', 'Hasan', 'Nadia', 'Saleha', 'Shah
Jamal', 'Shahid', 'Taj', 'Umair', 'Waqar']
Transcribed Image Text:2. Insertion Sort
Insertion sort is a simple sorting algorithm, a comparison sort in which the
sorted array (or list) is built one entry at a time. An example of an insertion sort
occurs in everyday life while playing cards. To sort the cards in your hand you
extract a card, shift the remaining cards, and then insert the extracted card in
the correct place. This process is repeated until all the cards are in the correct
sequence.
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 2 steps with 2 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