An array in ascending order in C: Difference between revisions

wikademia>JWSchmidt
wikademia>Dr. Eme
 
(7 intermediate revisions by 5 users not shown)
Line 1: Line 1:
<pre>/* TO PRINT THE NUMBERS IN ASCENDING AND DESCENDING ORDER USING ARRAYS */
<source lang="c">
/* PERFORMED BY MILAN */
/* PERFORMED BY MILAN */


#include <stdio.h>
#include <stdio.h>
#include<conio.h>


void main()
/* main: sort an array and display in ascending and descending order */
int main(void)
{
{
int a[10], i=0, j=0, n, t;
    int a[10], i=0, j=0, n, t;
clrscr();


printf ("\n Enter the no. of elements: ");
    printf("\nEnter the no. of elements: ");
scanf ("%d", &n);
    scanf("%d", &n);
printf ("\n");
    printf("\n");


for (i = 0; i <n; i++)
    for (i = 0; i < n; i++)
{
    {
printf ("\n Enter the %dth element: ", (i+1));
        printf("\nEnter element %d: ", (i+1));
scanf ("%d", &a[i]);
        scanf("%d", &a[i]);
}
    }


for (j=0 ; j<(n-1) ; j++)
    for (i = 0; i < (n-1); i++)
{
    {
for (i=0 ; i<(n-1) ; i++)
        for (j = 0; j < (n-1); j++)
        {
            if (a[j+1] < a[j])
{
{
if (a[i+1] < a[i])
                t = a[j];
{
                a[j] = a[j + 1];
t = a[i];
                a[j + 1] = t;
a[i] = a[i + 1];
            }
a[i + 1] = t;
        }
}
    }
}
 
}
    printf ("\nAscending order: ");
    for (i = 0; i < n; i++)
    {
        printf (" %d", a[i]);
    }


printf ("\n Ascending order: ");
    printf ("\nDescending order: ");
for (i=0 ; i<n ; i++)
    for (i = n; i > 0; i--)
{
    {
printf (" %d", a[i]);
        printf (" %d", a[i-1]);
}
    }


printf ("\n Descending order: ");
    /* indicate success */
for (i=n ; i>0 ; i--)
    return 0;
{
printf (" %d", a[i-1]);
}
getch();
}
}
/* OUTPUT:
 
/* EXAMPLE OUTPUT:


  Enter the no. of elements: 5
  Enter the no. of elements: 5
Line 64: Line 66:
  Descending order:  100 75 50 35 25
  Descending order:  100 75 50 35 25
  */
  */
</pre>
</source>
[[Category:C source code examples]]
[[Category:C source code examples]]