Thread: sort

This sorting program currently sort into ascending order

How can I change it to be able to both sort in ascending or descending [/code]depending on how the sort() function is invoked

Code:

#include <stdio.h>

void sort(int u[], int n);
int main(void)
{
    int u[]={333,111,444,555,999};
    int n=sizeof(u)/sizeof(int);
	int k;

    sort(u,n);

	for (k=0;k<n;k++)
		printf("%d\n", u[k]);
	 
   return 0;
}

void sort(int u[], int n)
{
	int i,j,tmp;
	
	for (i=1;i<n;i++)
		for (j=i;j>0;j--)
		{
			if (u[j]> u[j-1])
			{
				tmp=u[j];
				u[j]=u[j-1];
				u[j-1]=tmp;
			}
			else break;
		}
		return;
}

Simple...

Code:

if (u[j] > u[j-1])

(assuming the code you posted does work)

Code:

#include <stdio.h>

void sortdescending(int u[], int n);
void sortascending(int u[], int n);
int main(void)
{
int u[]={333,111,444,555,999};
int n=sizeof(u)/sizeof(int);
int k;
int choice;

printf("Press 1 to sort in ascending order\n");
printf("Press 2 to sort in descending order\n");
scanf("%d", &choice);

if (choice == 1)
	{
		sortascending(u,n);
	}

	else
		{
			sortdescending(u,n);
		}

		for (k=0;k<n;k++)
		printf("%d\n", u[k]);

return 0;
}

void sortdescending(int u[], int n)
{
int i,j,tmp;

for (i=1;i<n;i++)
for (j=i;j>0;j--)
{
if (u[j]> u[j-1])
{
tmp=u[j];
u[j]=u[j-1];
u[j-1]=tmp;
}
else break;
}
return;
}

void sortascending(int u[], int n)
{
int i,j,tmp;

for (i=1;i<n;i++)
for (j=i;j>0;j--)
{
if (u[j]< u[j-1])
{
tmp=u[j];
u[j]=u[j-1];
u[j-1]=tmp;
}
else break;
}
return;
}

or something of the like.

yea... all you do is reverse the logic

if x is greater than x+1; swap 'em -> ascending
if x is less than x+1 swap 'em -> descending

Sorry, but i can't really figure it out,

Code:

int n=sizeof(u)/sizeof(int);

Is it really necessary to be using sizeof?
Isn't it just getting the size of the array?

Thank you all for your help

Thank you Salem...I think you answered my question...This is what I was looking for.