# Insertion Sort - Part 1 Solution

**Sorting**

One common task for computers is to sort data. For example, people might want to see all their files on a computer sorted by size. Since sorting is a simple problem with many different possible solutions, it is often used to introduce the study of algorithms.

**Insertion Sort**

These challenges will cover *Insertion Sort*, a simple and intuitive sorting algorithm. We will first start with a nearly sorted list.

**Insert element into sorted list**

Given a sorted list with an unsorted number in the rightmost cell, can you write some simple code to insert into the array so that it remains sorted?

Since this is a learning exercise, it won't be the most efficient way of performing the insertion. It will instead demonstrate the brute-force method in detail.

Assume you are given the array indexed . Store the value of . Now test lower index values successively from to until you reach a value that is lower than , in this case. Each time your test fails, copy the value at the lower index to the current index and print your array. When the next lower indexed value is smaller than , insert the stored value at the current index and print the entire array.

The results of operations on the example array is:

Starting array:

Store the value of Do the tests and print interim results:

```
1 2 4 5 5
1 2 4 4 5
1 2 3 4 5
```

**Function Description**

Complete the *insertionSort1* function in the editor below. It should print the interim and final arrays, each on a new line.

insertionSort1 has the following parameter(s):

*n*: an integer, the size of*arr*: an array of integers to sort

**Input Format**

The first line contains the integer , the size of the array .

The next line contains space-separated integers .

**Constraints**

**Output Format**

Print the array as a row of space-separated integers each time there is a shift or insertion.

**Sample Input**

```
5
2 4 6 8 3
```

**Sample Output**

```
2 4 6 8 8
2 4 6 6 8
2 4 4 6 8
2 3 4 6 8
```

**Explanation**

is removed from the end of the array.

In the ^{st} line , so is shifted one cell to the right.

In the ^{nd} line , so is shifted one cell to the right.

In the ^{rd} line , so is shifted one cell to the right.

In the ^{th} line , so is placed at position .

**Next Challenge**

In the next Challenge, we will complete the insertion sort itself!

Solution in Python

```
def insertionSort1(n, arr):
n-=1
i = arr[n]
while n>0:
if i > arr[n-1]:
arr[n] = i
print(*arr)
break
else:
arr[n] =arr[n-1]
print(*arr)
n-=1
else:
arr[0] = i
print(*arr)
n = int(input())
arr = list(map(int,input().split()))
insertionSort1(n, arr)
```