sethlahaul

Try using this code void quicksort(int *a,int l,int h) { int x; if(l>=h) return; x=partition(a,l,h); quicksort(a,l,x-1); quicksort(a,x+1,h); } int partition(int *a,int l,int h) { int i,j,pv; pv=a[l]; i=l,j=h; while(i<=j) { while(a[i]<=pv) i++; while(a[j]>pv) j--; if(i<j) swap(a,i,j); } swap(a,l,j); int k=0; printf("\n"); for(k=0;k<n;k++) printf("%4d",a[k]); printf("\n"); return(i-1); }

Try implementing this code void reverse(node **ptr) { node *current,*prev,*temp; current=*ptr; prev=temp=NULL; while(current!=NULL) { temp=prev; prev=current; current=current->next; prev->next=temp; } *ptr=prev; }

Try something like this ..... void del_pos(node **ptr) { int nd,x; node *current,*prev=NULL; current=*ptr; printf("Enter the element to delete : "); scanf("%d",&x); if(*ptr==NULL) printf("\nList is empty !!!!"); while(current!=NULL) { if(current->info==x) { if(current==*ptr) { *ptr=current->next; free(current); } else { prev->next=current->next; free(current); } } else { prev=current; current=current->next; } } printf("\nElement deleted …