C Program – Quicksort Program implementation
#include<stdio.h> void quick_sort(int arr_num[25],int first,int last){ int temp,i, j, pivot; if(first<last){ pivot=first; i=first; j=last; while(i<j){ while(arr_num[i]<=arr_num[pivot]&&i<last) i++; while(arr_num[j]>arr_num[pivot]) j--; if(i<j){ temp=arr_num[i]; arr_num[i]=arr_num[j]; arr_num[j]=temp; } } temp=arr_num[pivot]; arr_num[pivot]=arr_num[j]; arr_num[j]=temp; quick_sort(arr_num,first,j-1); quick_sort(arr_num,j+1,last); } } int main(){ int i, size,arr_num[25]; printf("How many number of elements going to enter?: "); scanf("%d",&size); printf("Enter %d elements: ", size); for(i=0;i<size;i++) scanf("%d",&arr_num[i]); quick_sort(arr_num,0,size-1); printf("Sorted elements order are: "); for(i=0;i<size;i++) printf(" %d",arr_num[i]); return0; }
Output:-