Pagini recente » Cod sursa (job #1651427) | Cod sursa (job #813932) | Cod sursa (job #970406) | Cod sursa (job #2871731) | Cod sursa (job #3133140)
#include <stdio.h>
void ischimb(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
}
int pivot(int arr[], int mic, int mare) {
int pivot = arr[mare];
int i = mic - 1;
for (int j = mic; j <= mare - 1; j++) {
if (arr[j] < pivot) {
i++;
ischimb(&arr[i], &arr[j]);
}
}
ischimb(&arr[i + 1], &arr[mare]);
return (i + 1);
}
void quickSort(int arr[], int mic, int mare) {
if (mic < mare) {
int pi = pivot(arr, mic, mare);
quickSort(arr, mic, pi - 1);
quickSort(arr, pi + 1, mare);
}
}
void printArray(int arr[], int size) {
for (int i = 0; i < size; i++) {
printf("%d ", arr[i]);
}
printf("\n");
}
int main() {
int arr[] = { 10, 7, 8, 9, 1, 5 };
int n = sizeof(arr) / sizeof(arr[0]);
printf("Array before sorting:\n");
printArray(arr, n);
quickSort(arr, 0, n - 1);
printf("Array after sorting:\n");
printArray(arr, n);
return 0;
}