/* Bubble sort:
code snippet only
nos to be sorted are in the array named 'n' of size 'N'
for(int i=0;i<N-1;i++)
for(int j=i+1;j<N-1-i;j++)
if(n[j]>n[j+1])
swap(n[j],n[j+1]);
*/
/*
insertion sort
int v,j;
for(int i=1;i<N;i++)
{
v=n[j];
for(int j=i-1;j>0&&n[j]>v;j--)
n[j+1]=n[j];
n[j+1]=v;
}
*/