Various sorting techniques available in C

bubblesort.c

#include<stdio.h>
int main()
{
    int arr[25], n, i, j, temp;
    printf("\n Number of elements: ");
    scanf("%d", &n);
    printf("\nEnter the elements: ");
    for(i = 0;i < n; i++)
        scanf("%d", &arr[i]);

    for(i=0;i<n-1;i++)
    {
        for(j=0;j<n-i-1;j++)
        {
            if(arr[j] > arr[j+1])
            {
                temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
    printf("\nElements in the (Ascending) sorted order are: ");
    for(i = 0;i < n; i++)
        printf("%d ", arr[i]);
    return 0;
}

selectionsort.c

#include<stdio.h>
int main()
{
    int arr[25], i, j, n, temp;
    printf("\n Number of elements: ");
    scanf("%d", &n);
    printf("\nEnter the elements: ");
    for(i = 0;i < n; i++)
        scanf("%d", &arr[i]);

    for(i = 0; i<n-1; i++)
    {
        for(j = i+1; j<n; j++)
        {
            if(arr[j] < arr[i])
            {
                temp = arr[j];
                arr[j] = arr[i];
                arr[i] = temp;
            }
        }
    }
    printf("\nElements in the (Ascending) sorted order are: ");
    for(i = 0;i < n; i++)
        printf("%d ", arr[i]);
    return 0;
}