Pure Insertion Sort - Hackerrank Problem Solution

Pure Insertion Sort

Hackerrank Problem Solution

PROBLEM STATEMENT

You are given an array of integers in any order. Sort the elements of given array in ascending order using Insertion sort.

Input Format

The first line contains an integer, n , the size of the array

The second line contains n space-separated integers a[i].

Constraints

2<=n<=600 1<=a[i]<=2*10^6

Output Format

Space separated elements of array sorted in ascending order are printed in first line Print number of comparisons space number of swaps in next line

Sample Input 0

5
1 2 3 4 5

Sample Output 0

1 2 3 4 5
10 0

---

SOLUTION

#include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int swappings=0,comp=0; void printArray(int arr[], int size) { int i; for (i=0; i < size; i++) printf("%d ", arr[i]); printf("\n"); } int main() { int n,a[100],i,j,key; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=1;i<n;i++) { key = a[i]; j = i-1; while (j>=0 && a[j]>key) { a[j+1]=a[j]; j=j-1; swappings++; } a[j+1]=key; } comp=n*(n-1)/2; printArray(a, n); printf("%d ",comp); printf("%d",swappings); /* Enter your code here. Read input from STDIN. Print output to STDOUT */ return 0; }

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.