#include
#define N 50
int main()
{
int num[N], i=0, count =0;
printf("Enter 0 to exit entering integers.\n\nEnter your integers:\n");
do
{
if( scanf("%d", &num[i]) != 1) break;
++i;
count++;
} while ( i
As an alternative, tou might use qsort:
#include
#include
#define N 50
int comp(const void * a, const void *b)
{
return *(int *)b - *(int*)a;
}
int main()
{
int num[N], i=0, count =0;
printf("Enter 0 to exit entering integers.\n\nEnter your integers:\n");
do
{
if( scanf("%d", &num[i]) != 1) break;
++i;
count++;
} while ( i