sorting by array(descending)

#include<stdio.h>
void sort(int m,int x[]);
main()
{
int i,marks[5]={13,3,54,554,300};
sort(5,marks);
printf("Marks after sorting\n");
for(i=0;i<5;i++)
printf("%4d",marks[i]);
printf("\n");
}
void sort(int m,int x[])
{
int i,j,t;
for(i=1;i<=m-1;i++)
for(j=1;j<=m-i;j++)
if(x[j-1]<=x[j])
{
t=x[j-1];
x[j-1]=x[j];
x[j]=t;
}
}

sorting by array(ascending)

#include<stdio.h>
void sort(int m,int x[]);
main()
{
int i,marks[5]={13,3,54,554,300};
sort(5,marks);
printf("Marks after sorting\n");
for(i=0;i<5;i++)
printf("%4d",marks[i]);
printf("\n");
}
void sort(int m,int x[])
{
int i,j,t;
for(i=1;i<=m-1;i++)
for(j=1;j<=m-i;j++)
if(x[j-1]>=x[j])
{
t=x[j-1];
x[j-1]=x[j];
x[j]=t;
}
}

c code for reverse an integer

#include <stdio.h>

int main()

{

    int n, reversedNumber = 0, remainder;

    printf("Enter an integer: ");

    scanf("%d", &n);

    while(n != 0)

    {

        remainder = n%10;

        reversedNumber = reversedNumber*10 + remainder;

        n /= 10;

    }

    printf("Reversed Number = %d", reversedNumber);

    return 0;

}