Answered! 1 b. Modify the QUICKSORT and PARTITION procedures to sort in decreasing order….

1 b. Modify the QUICKSORT and PARTITION procedures to sort in decreasing order.

Don't use plagiarized sources. Get Your Custom Essay on
Answered! 1 b. Modify the QUICKSORT and PARTITION procedures to sort in decreasing order….
GET AN ESSAY WRITTEN FOR YOU FROM AS LOW AS \$13/PAGE

#include <stdio.h>

int main(void)

{

int a[10], i=0, j=0, n, t;

printf (“n Enter the no. of elements: “);

scanf (“%d”, &n);

printf (“n”);

for (i = 0; i <n; i++)

{

printf (“n Enter the %dth element: “, (i+1));

scanf (“%d”, &a[i]);

}

for (j=0 ; j<(n-1) ; j++)

{

for (i=0 ; i<(n-1) ; i++)

{

if (a[i+1] < a[i])

{

t = a[i];

a[i] = a[i + 1];

a[i + 1] = t;

}

}

}

printf (“n Ascending order: “);

for (i=0 ; i<n ; i++)

{

printf (” %d”, a[i]);

}

printf (“n Descending order: “);

for (i=n ; i>0 ; i–)

{

printf (” %d”, a[i-1]);

}

/* indicate successful completion */

return 0;

}

/* OUTPUT:

Enter the no. of elements: 5

Enter the 1th element: 25

Enter the 2th element: 50

Enter the 3th element: 75

Enter the 4th element: 35

Enter the 5th element: 100

Ascending order: 25 35 50 75 100

Descending order: 100 75 50 35 25