The document discusses insertion sort, a simple sorting algorithm that builds a sorted output list from an input one element at a time. It is less efficient on large lists than more advanced algorithms. Insertion sort iterates through the input, at each step removing an element and inserting it into the correct position in the sorted output list. The best case for insertion sort is an already sorted array, while the worst is a reverse sorted array.

2. Sorting:
Question: How do you sort out data?
a-z
a-ZA-Z
0,1,2,3…..
Looking For Patterns
Question: Why do we sort out data?
Answer: For effective analysis of data?

3. Common Sorting:

4. Insertion Sort
 Insertion sort is a simple sorting algorithm
that builds the final sorted array (or list)
one item at a time
 It is much less efficient on large lists than more
advanced algorithms
 Insertion sort iterates, consuming one input
element each repetition, and growing a sorted
output list
 Each iteration, insertion sort removes one element
from the input data, finds the location it belongs
within the sorted list
Select Link here

5. Advantages / Disadvantages
Advantages Disadvantages
• Simple It is much less efficient on
large lists
• Efficient in practice than
most other simple
quadratic
• Does not change the
relative order of elements
with equal key
• Only requires a constant
amount O(1) of additional
memory space
• Can sort a list as it
receives it
Least Advanced to other
Algoritms

6. Best/Worst Array
Best Array:
 The best case input is an array that is already sorted.
 In this case insertion sort has a linear running time
 (i.e., Θ(n)). During each iteration
 The first remaining element of the input is only compared with
the right-most element of the sorted subsection of the array.
Worst Array:
 The simplest worst case input is an array sorted in reverse order
 The set of all worst case inputs consists of all arrays where each
 element is the smallest or second-smallest of the elements before it.
 In these cases every iteration of the inner loop will scan and shift
 the entire sorted subsection of the array before inserting the next element.

7. Now for a Quiz!!!!!!
Please read the set of questions and select
the correct answers

8. Question 1
Complete the following sentence “Insertion
Sort is...?
a) “….a complex sorting algorithm”
b) “… a simple sorting algorithm”
c) “…the most efficient sorting
algoritm”

9. Oh No Try Again!
Or select to quit

10. Correct Answer!!!!!
Well Done go to the next question

11. Question 2
How does Insertion operate?
a) Builds the final sorted array (or
list) one item at a time
b) Builds the final sorted array (or
list) in data batches
c) Builds the final sorted array (or
list) in reverse order

12. Correct Answer!!!!!
Well Done go to the next question

13. Oh No Try Again!
Or select to quit

14. Question 3
True or False
“One of the advantages of Insertion is that it
only requires a constant amount an
additional memory space”
True False

15. Correct Answer!!!!!
Well Done go to the next question

16. Oh No Try Again!
Or select to quit

17. Question 4
True of False, Insertion is most efficient on
large lists?
True False

18. Correct Answer!!!!!
Well Done go to the next question

19. Oh No Try Again!
Or select to quit

20. Question 5
The Best Array is…
a) Data grouped in alphabetical
order
b) Data grouped in reverse order
c) Data already sorted

21. Correct Answer!!!!!
Well Done go to the next question

22. Oh No Try Again!
Or select to quit