Sample codes of Insertion sort using c plus plus?

Answer 1

#include<iostream>

#include<array>

#include<cassert>

void sort (int* arr, const size_t size)

{

for (size_t pos=1; pos<size; ++pos)

{

int stored = arr[pos];

int gap = pos;

int previous = gap-1;

while (gap && stored<arr[previous])

{

arr[gap] = arr[previous];

gap = previous--;

}

arr[gap] = stored;

}

}

int main()

{

std::array<int, 10> a = {5, 3, 8, 1, 9, 6, 2, 0, 4, 7};

sort (a.data(), a.size());

for (size_t x=1; x<a.size(); ++x)

assert (a[x-1]<a[x]);

}