In this post, we will solve HackerRank Correctness and the Loop Invariant Problem Solution.
In the previous challenge, you wrote code to perform an Insertion Sort on an unsorted array. But how would you prove that the code is correct? I.e. how do you show that for any input your code will provide the right output?
Loop Invariant
In computer science, you could prove it formally with a loop invariant, where you state that a desired property is maintained in your loop. Such a proof is broken down into the following parts:
- Initialization: It is true (in a limited sense) before the loop runs.
- Maintenance: If it’s true before an iteration of a loop, it remains true before the next iteration.
- Termination: It will terminate in a useful way once it is finished.
Insertion Sort’s Invariant
Say, you have some InsertionSort code, where the outer loop goes through the whole array A:
for(int i = 1; i < A.length; i++){
//insertion sort code
You could then state the following loop invariant:
To prove Insertion Sort is correct, you will then demonstrate it for the three stages:
- Initialization – The subarray starts with the first element of the array, and it is (obviously) sorted to begin with.
- Maintenance – Each iteration of the loop expands the subarray, but keeps the sorted property. An element V gets inserted into the array only when it is greater than the element to its left. Since the elements to its left have already been sorted, it means V is greater than all the elements to its left, so the array remains sorted. (In Insertion Sort 2 we saw this by printing the array each time an element was properly inserted.)
- Termination – The code will terminate after i has reached the last element in the array, which means the sorted subarray has expanded to encompass the entire array. The array is now fully sorted.
You can often use a similar process to demonstrate the correctness of many algorithms. You can see these notes for more information.
Challenge
In the InsertionSort code below, there is an error. Can you fix it? Print the array only once, when it is fully sorted.
Input Format
There will be two lines of input:
- s – the size of the array
- arr – the list of numbers that makes up the array
Sample Input
6 7 4 3 5 6 2
Sample Output
2 3 4 5 6 7
Explanation
The corrected code returns the sorted array.
Correctness and the Loop Invariant C Solution
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
/* Head ends here */
#include <stddef.h>
void insertionSort(int ar_size, int * ar) {
int i,j;
int value;
for(i=1;i<ar_size;i++)
{
value=ar[i];
j=i-1;
while(j>=0 && value<ar[j])
{
ar[j+1]=ar[j];
j=j-1;
}
ar[j+1]=value;
}
for(j=0;j<ar_size;j++)
{
printf("%d",ar[j]);
printf(" ");
}
}
/* Tail starts here */
int main(void) {
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;
}Correctness and the Loop Invariant C++ Solution
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
for(int i = 0; i < n; i++) cin >> v[i];
for(int i = 1; i < n; i++){
for(int j = i; j > 0 && v[j] < v[j-1]; j--) swap(v[j], v[j-1]);
}
for(int j = 0; j < n; j++) cout << (j?" ":"") << v[j]; cout << endl;
return 0;
}Correctness and the Loop Invariant C Sharp Solution
using System;
using System.Collections.Generic;
using System.IO;
class Solution {
/* Head ends here */
public static void insertionSort (int[] A){
for (int i = 0; i < A.Length; i++)
{
int value = A[i];
int j = i-1;
while (j > -1 && A[j] > value)
{
A[j + 1] = A[j];
j--;
}
A[j + 1] = value;
}
Console.WriteLine(string.Join(" ", A));
}
/* Tail starts here */
static void Main(string[] args) {
int _ar_size = Convert.ToInt32(Console.ReadLine());
string[] numbers = Console.ReadLine().Split(new[] { ' '});
var _ar = new int [_ar_size];
for(int _ar_i=0; _ar_i < _ar_size; _ar_i++) {
_ar[_ar_i] = Convert.ToInt32(numbers[_ar_i]);
}
insertionSort(_ar);
}
}Correctness and the Loop Invariant Java Solution
import java.io.*;
import java.util.*;
public class Solution{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int len = in.nextInt();
int[] arr = new int[len];
for(int i = 0; i < len; i++)
arr[i] = in.nextInt();
SelectionSort(arr);
}
public static void SelectionSort(int[] arr){
for(int i = 1; i < arr.length; i++){
for(int j = 0; j < i; j++){
if(arr[i] < arr[j]){
int tmp = arr[i];
for(int k = i; k > j; k--){
arr[k] = arr[k - 1];
}
arr[j] = tmp;
}
}
}
for(int j = 0; j < arr.length; j++)
System.out.print(arr[j] + " ");
}
}Correctness and the Loop Invariant JavaScript Solution
function processData(input){
input = input.split("\n");
var array = input[1].split(" ").map(function (num){return parseInt(num);});
insertionSort(array);
var s = "";
array.forEach(function (n){s += n + " ";});
console.log(s.substr(0,s.length - 1));
}
function insertionSort (ar) {
for(i = 1; i < ar.length; i++){
var value = ar[i];
var j = i - 1;
while(j >= 0 && ar[j] > value){
ar[j + 1] = ar[j];
j = j - 1;
}
ar[j + 1] = value;
}
return ar;
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});
process.stdin.on("end", function () {
processData(_input);
});
Correctness and the Loop Invariant Python Solution
def insertion_sort(l):
for i in range(1, len(l)):
j = i-1
key = l[i]
while (l[j] > key) and (j >= 0):
l[j+1] = l[j]
j -= 1
l[j+1] = key
m = int(input().strip())
ar = [int(i) for i in input().strip().split()]
insertion_sort(ar)
print(" ".join(map(str,ar)))Other Solutions
