Files
TD1_DEV51_Qualite_Algo/heapsort.h

16 lines
379 B
C
Raw Normal View History

#ifndef __HEAPSORT__
#define __HEAPSORT__
void heapsort(int* array, int length);
void generate_array(int* array, int length);
void print_array(int* array, int length);
2025-09-10 17:24:24 +02:00
void echanger(int *a, int *b);
int partitionner(int T[], int premier, int dernier, int pivot);
int choix_pivot(int T[], int premier, int dernier);
void tri_rapide(int T[], int premier, int dernier);
#endif