-
Notifications
You must be signed in to change notification settings - Fork 3
/
InsertionSort.py
48 lines (35 loc) · 1.21 KB
/
InsertionSort.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# Provided with a random integer array/list(ARR) of size N, you have been required to sort this array using 'Insertion Sort'.
# Input format :
# The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
# First line of each test case or query contains an integer 'N' representing the size of the array/list.
# Second line contains 'N' single space separated integers representing the elements in the array/list.
from sys import stdin
def insertionSort(arr, n) :
#Your code goes here
for i in range(1, n):
temp = arr[i]
j = i-1
while temp < arr[j] and j >= 0:
arr[j+1] = arr[j]
j -= 1
arr[j+1] = temp
return arr
#Taking Input Using Fast I/O
def takeInput() :
n = int(stdin.readline().strip())
if n == 0 :
return list(), 0
arr = list(map(int, stdin.readline().strip().split(" ")))
return arr, n
#to print the array/list
def printList(arr, n) :
for i in range(n) :
print(arr[i], end = " ")
print()
#main
t = int(stdin.readline().strip())
while t > 0 :
arr, n = takeInput()
insertionSort(arr, n)
printList(arr, n)
t-= 1