Simple sort

a [j 1] = a [j];

J -;

}

A [J 1] = T;

}

}

// Running Sort: Stability

Void Bubblesort (int A [], int N)

{

INT I, J, K, T;

i = 0;

DO

{

K = 1;

For (j = 0; j

IF (a [j]> a [j 1])

{

T = a [j];

a [j] = a [j 1];

A [J 1] = T;

K = 0;

}

} while (k! = 1);

}

void main ()

{

INT A [] = {1, 2, 5, 4, 9, 6, 3, 7, 8, 0};

For (int i = 0; i <10; i )

Printf ("% d", a [i]);

Printf ("/ n");

Selectionsort (A, 10);

For (i = 0; i <10; i )

Printf ("% d", a [i]);

Printf ("/ n");

INSERTSORT (A, 10);

For (i = 0; i <10; i )

Printf ("% d", a [i]);

Printf ("/ n");

Bubblesort (A, 10);

For (i = 0; i <10; i )

Printf ("% d", a [i]);

}