cw07 06

// Daniel Wojnarowskij // Ćwiczenie 07-06 #include <stdio.h> #include <stdlib.h> linclude <limits.h>

int Partition( int* array, int 1, int r ) {

int x = array[l]; int i = 1; int j = r;

while( 1 )

void QuickSort( int* array, int 1, int r ) // inclusive-inclusive {

if( 1 < r )

{

int i = Partition( array, 1, r );

QuickSort( array, 1, i ) ;

QuickSort( array, i+1, r) ;

>

>

void PrintArray( int* array, int start, int stop ) // inclusive-exclusive {

unsigned i;

int mod =1;

if( start > stop).

printf("\n") ;

>

int main()

{

system("elear");

FILE* file;

file = fopen( "dane.x", "r+" ); int size;

fscanf( file, "%d", &size );

int* array = (int*) malloc( size * sizeof( int )); unsigned i;

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

<------>fscanf ( file, "%d", &array[i] );

PrintArray( array, 0,size );

QuickSort( array, 0, size-1 );.

printf("Posortowane min-max: ");

PrintArray( array, 0, size );

printf("Posortowane max-min: " );

PrintArray( array, size-1, -1 );

free( array ) ; array = NULL;

return 0;

>1