Insertion Sort - Part 1
Problem Statement :
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. Function Description Complete the insertionSort1 function in the editor below. insertionSort1 has the following parameter(s): n: an integer, the size of arr arr: an array of integers to sort Returns None: Print the interim and final arrays, each on a new line. No return value is expected. Input Format The first line contains the integer n, the size of the array arr. The next line contains n space-separated integers arr[0] . . . arr[ n - 1 ] . Constraints 1 <= n <= 1000 -10000 <= arr[ i ] <= 10000 Output Format Print the array as a row of space-separated integers each time there is a shift or insertion.
Solution :
Solution in C :
In C++ :
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
/* Head ends here */
void insertionSort(vector <int> ar) {
int n = ar.size();
if(n==0)
return;
if(n==1)
cout<<ar[n-1]<<endl;
int curr = ar[n-1];
int i=n-2;
while(i>=0){
if(ar[i]>=curr){
ar[i+1]=ar[i];
}
else{
ar[i+1]=curr;
i=-1;
}
for(int j=0;j<n;j++)
cout<<ar[j];
cout<<endl;
if(i==0){
ar[i]=curr;
for(int j=0;j<n;j++)
cout<<ar[j];
cout<<endl;
}
i--;
}
}
int main() {
vector <int> _ar;
int _ar_size;
cin >> _ar_size;
for(int _ar_i=0; _ar_i<_ar_size; _ar_i++) {
int _ar_tmp;
cin >> _ar_tmp;
_ar.push_back(_ar_tmp);
}
insertionSort(_ar);
return 0;
}
In Java :
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
int s=scan.nextInt();
int ar[]=new int[s];
boolean check=false;
for(int i=0;i<s;i++)
{
ar[i]=scan.nextInt();
}
int var=ar[s-1];
for(int i=s-2;i>=-1;i--)
{
if(i!=-1)
{
if(var<ar[i])
{
ar[i+1]=ar[i];
}
else
{
ar[i+1]=var;
check=true;
}
}
else
{
ar[0]=var;
}
for(int j=0;j<s;j++)
System.out.print(ar[j]+" ");
System.out.println();
if(check)
break;
}
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
/* Head ends here */
void insertionSort(int ar_size, int * ar) {
int v;
int idx;
int i;
int done = 0;
v = ar[ar_size - 1];
for (idx = ar_size-2; idx >= 0; idx--) {
if (v > ar[idx]) {
ar[idx+1] = v;
done = 1;
} else {
ar[idx+1] = ar[idx];
}
for (i = 0; i < ar_size; i++)
printf("%d ", ar[i]);
printf("\n");
if (done)
break;
}
if (!done) {
ar[0] = v;
for (i = 0; i < ar_size; i++)
printf("%d ", ar[i]);
printf("\n");
}
}
/* Tail starts here */
int main() {
int _ar_size;
scanf("%d", &_ar_size);
int _ar[_ar_size], _ar_i;
for(_ar_i = 0; _ar_i < _ar_size; _ar_i++) {
scanf("%d", &_ar[_ar_i]);
}
insertionSort(_ar_size, _ar);
return 0;
}
In Python3 :
n = int(input())
d = [int(x) for x in input().split()]
t = d[n-1]
k = n-2
while k >= 0 and t < d[k]:
d[k+1] = d[k]
s = str(d)[1:-1].replace(",", "")
print(s)
k -= 1
d[k+1] = t
s = str(d)[1:-1].replace(",", "")
print(s)
View More Similar Problems
Equal Stacks
ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of
View Solution →Game of Two Stacks
Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f
View Solution →Largest Rectangle
Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle
View Solution →Simple Text Editor
In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,
View Solution →Poisonous Plants
There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan
View Solution →AND xor OR
Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value
View Solution →