Insertion Sort - Part 1

Tender Thrush answered on October 19, 2022 Popularity 7/10 Helpfulness 2/10

answer Insertion Sort - Part 1

Insertion Sort - Part 1

Comment

#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'insertionSort1' function below.
#
# The function accepts following parameters:
#  1. INTEGER n
#  2. INTEGER_ARRAY arr
#

def insertionSort1(n, arr):
    target = arr[-1]
    idx = n-2

    while (target < arr[idx]) and (idx >= 0):
        arr[idx+1] = arr[idx]
        print(*arr)
        idx -= 1

    arr[idx+1] = target
    print(*arr)

if __name__ == '__main__':
    n = int(input().strip())

    arr = list(map(int, input().rstrip().split()))

    insertionSort1(n, arr)

Popularity 7/10 Helpfulness 2/10 Language whatever

Source: programs.programmingoneonone.com

Tags: insertion-sort whatever

Link to this answer
Share Copy Link

Contributed on Oct 19 2022

Tender Thrush

0 Answers Avg Quality 2/10

Insertion Sort - Part 1

Contents

More Related Answers

Insertion Sort - Part 1

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.