Quick sort using in-built function / library function

Quick sort using in-built function / library function

#include <stdio.h> #include <stdlib.h> int cmpfunc(const void *a,const void *b) { return (*(int*)a-*(int*)b); } int main(void) { int *a; int n,i; a=(int*)malloc(sizeof(int)*1000); scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",(a+i)); qsort(a,5,sizeof(int),cmpfunc); for(i=0;i<n;i++) printf("%d ",*(a+i)); return 0; }