//Program Ordena (m‚todo: quicksort) #include #include #define num 3 int i = num, j; int array1 [num], array2 [num], array3 [num*2], aux; void settings (int a, int b); void tope (void); void titulo (void); int intcomp (const void *v1, const void *v2); main () { for (; i>0; i--) { settings (1, num-i+1); scanf ("%d", &array1[num-i]); array3[num-i] = array1[num-i]; } for (; i\n\n"); textcolor (0); textbackground (9); clreol (); gotoxy ( 1,3); printf ("Ascendente"); gotoxy (41,3); printf ("Descendente"); } void tope (void) { if (wherey() == 24) { textcolor (15); textbackground (4); puts(""); clreol (); gotoxy (23,25); printf (""); getch (); titulo (); } }