Bubble Sort

Source Code:

#include<bits/stdc++.h>

int main()
{
int N,number[100],i,j,temp;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d",&number[i]);
for(i=1;i<=N-1;i++)
{
    for(j=0;j<N-i;j++)
    {
        if(number[j]>number[j+1])
        {
            temp=number[j];
            number[j]=number[j+1];
            number[j+1]=temp;
        }
    }
}
printf("\nAfter Ascending order sorting, sorted values are:\n");
for(i=0;i<N;i++)
    printf("%d ",number[i]);
return 0;
}