15/11/2021

Tri par selection

Algorithmes de tri

1
 15/11/2021

Tri par insertion

Tri a bulles

2
 15/11/2021

void merge( int arr[], int start, int mid, int end ) {
int len1 = mid - start + 1;
Merge sort int len2 = end - mid; Merge
int leftArr[len1], rightArr[len2];

for (int i = 0; i < len1; i++)

leftArr[i] = arr[start + i];
while (i < len1) {
Void mergeSort( int arr[], int start, int end ) { arr[ k ] = leftArr[ I ];
for (int j = 0; j < len2; j++)
i++;
if ( start < end ) { rightArr[j] = arr[mid + 1 + j];
k++;
int mid = start + (end - start) / 2; 34 25 }
mergeSort( arr, start, mid ); int i, j, k;
mergeSort( arr, mid + 1, end ); i = 0; j = 0; k = start; while (j < len2) {
merge( arr, start, mid, end ); 34 25 arr[ k ] = rightArr[ j ];
} while ( i < len1 && j < len2 ) { j++;
} if (leftArr[i] <= rightArr[j]) { k++;
arr[ k ] = leftArr[ i ]; }
23 4
i++; }
} else {
arr[ k ] = rightArr[ j ];
j++;
}
k++;
}