#include <stdio.h>
#include <stdlib.h>
void quicksort(int number[25], 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[1000];
printf("Enter How many random numbers\n");
scanf("%d", &count);
printf("The Random Numbers are:\n");
for (i = 1; i <= count; i++)
{
number[i] = rand() % 100 + 1; // generating random number
printf("%d\t", number[i]); // printing random number
}
quicksort(number, 0, count - 1);
printf("\nOrder of Sorted elements: \n");
for (i = 0; i < count; i++)
printf("%d\t", number[i]);
return 0;
}
Comments
Post a Comment
Subscribe Us and Thanks for visiting blog.