22/05/2023, 22:04 127.0.0.1:5500/02.Quick_Sort.
// 02.Programm to demonstrate the concept of QUICK sort
#include <stdio.h>
void quicksort(int number[10], int first, int last)
{
int i, j, pivot, temp;
if (first < last)
{
pivot = first;
i = first;
j = last;
while (i < j)
{
while (number[i] <= number[pivot] && i < last)
i++;
while (number[j] > number[pivot])
j--;
if (i < j)
{
temp = number[i];
number[i] = number[j];
number[j] = temp;
}
}
temp = number[pivot];
number[pivot] = number[j];
number[j] = temp;
quicksort(number, first, j - 1);
quicksort(number, j + 1, last);
}
}
int main()
{
int i, count, number[10];
printf("How many elements you want to enter (Max Size 10): ");
scanf("%d", &count);
printf("Enter %d elements : ", count);
for (i = 0; i < count; i++)
scanf("%d", &number[i]);
quicksort(number, 0, count - 1);
printf("The Sorted Order is:");
for (i = 0; i < count; i++)
printf(" %d", number[i]);
return 0;
}
/*
OUTPUT:
How many elements you want to enter (Max Size 10): 8
Enter 8 elements : 56 54 23 15 65 87 96 32
The Sorted Order is: 15 23 32 54 56 65 87 96
*/
127.0.0.1:5500/02.Quick_Sort.c 1/1