Questions about insertion sort

[Hakate]

Hi

i need to make a algorithm for insertion sort but i need to do this in one array.
i thought about making a for and a while like

for()
{
   while()
   {
     
   }
}

any help appreciated

[Mythios]

You want something in the terms of (a quick whoop up )

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int* InsertionSort(int* Array, int size)
{
	for( int i = 1; i < size; ++i )
	{
		int value = Array[i];
		int j = i - 1;

		while( j >= 0 && Array[j] > value )
		{
			Array[j + 1] = Array[j];
			j = j - 1;
		}
		Array[j + 1] = value;
	}

	return Array;
}

void PrintArray(int* Array, int size)
{
	for( int i = 0; i < size; i++ )
		std::cout << Array[i] << " ";
}

int main()
{
	// Seed the random number generator for purpose of filling the array with random ints
	srand( (unsigned)time(NULL) );
	int size = 0;
	std::cout << "How big would you like the array >> ";
	std::cin >> size;

	int* myArray = new int[size];

	for( int i = 0; i < size; i++ )
		myArray[i] = rand() % 100;

	std::cout << "Before Sort: " << std::endl;
	PrintArray(myArray, size);
	myArray = InsertionSort(myArray, size);
	std::cout << "\nAfter Sort: " << std::endl;
	PrintArray(myArray, size);

	return 0;
}

See if you can neaten it.

[Mythios]

Taken from : http://en.wikipedia.org/wiki/Insertion_sort

insertionSort(array A)
begin
    for i := 1 to length[A] do
    begin
        value := A[i];
        j := i - 1;
        while j >= 0 and A[j] > value do
        begin
            A[j + 1] := A[j];
            j := j - 1;
        end;
        A[j + 1] := value;
    end;
end;

[Hakate]

Thanks :) it worked fine

[Mythios]

No problem - hope it makes sense. Read up about it on wiki to have a better understanding of how it works.