Posts

Write a ‘C’ program to reverse an array elements using dynamic memory allocation.

-
Write a ‘C’ program to reverse an array elements using dynamic memory allocation. #include<stdio.h> #include<conio.h> #include<malloc.h> void main() { int n,i; int *p; clrscr(); printf("enter the size"); scanf("%d",&n); p=(int*)malloc(sizeof(int)*n); for(i=0;i<n;i++) { scanf("%d",&p[i]); } for(i=n-1;i>=0;i--) { printf("%d",p[i]); } getch(); }
Read more

Data structure using C .Write C program for Quick sort.

-
Data structure using C Write C program for Quick sort. #include<stdio.h> #include<conio.h> int split(int lp,int up); void quick(int lp,int up); int a[20]; void main() {  int n,i,lp,up;  clrscr();  printf("\n Enter how many number u want:-");  scanf(" %d",&n);  printf("\n Enter %d numbers:-",n);  for(i=0;i<n;i++)  {   scanf(" %d",&a[i]);  }  printf("\n Before sorting numbers are:-");  for(i=0;i<n;i++)  {   printf("\n%d",a[i]);  }  quick(0,n-1);  printf("\n After sorting numbers are:-");  for(i=0;i<n;i++)  {   printf("\n%d",a[i]);  }  getch(); } void quick(int lp,int up) {  int i;  if(up>lp)  {   i=split(lp,up);   quick(lp,i-1);   quick(i+1,up);  } } int split(int lp,int up) {  int k,p,q,t;  p=lp+1;  q=up;  k=a[lp];  while(q>=p)  { ...
Read more