Most Commonly Asked Programs In C++ Language |
- C Program To Perform Character Design : #03.
- C++ Program To Perform Heap Sort.
- C++ Program To Perform Quick Sort.
- C++ Program To Perform Insertion Sort In Ascending Order.
- Mini Project :~ Sorting Techniques Using Functions #02.
C Program To Perform Character Design : #03. Posted: 04 Jun 2013 09:38 AM PDT This Post Contains A C Program To Perform Character Design With Correct Source Code, Algorithm & Output. This Program Is Written, Compiled & Executed At TurboC/C++3.0 Compiler & Will Help You To Understand The Concept Of 'Nested For-Loops' From C Language. It Is A Well-Structured Program With Proper Comments Which Provides Step-By-Step Description Of Various Features Of The Language In A Simple & Easy-To-Understand Way. # Note : You Can Simply Copy-Paste The Following Program Or Code Into Compiler For Direct Result. C Program To Perform Character Design :#03. /* Declaration Of Header Files */ #include<stdio.h> #include<conio.h> /* Start Of Main Program */ int main() { /* Declaration Of Variables */ int num, row = 1, col = 0, space = 0; /* Asking For The Input From User */ printf(" \n Enter Number of Rows For Design : "); scanf("%d",&num); /* Source Code For Computing ----- */ for(; num>=1; num--, row++) { for(space = row; space>1; space--) printf(" "); for(col=1; col<=num; col++) printf("#"); printf("\n"); } getch(); return 0; } /* End Of Main Program */ Output :~ Enter Number of Rows For Design : 5 # # # # # # # # # # # # # # # |
C++ Program To Perform Heap Sort. Posted: 04 Jun 2013 05:23 AM PDT This Post Contains A C++ Program To Perform Heap Sort With Correct Source Code, Algorithm & Output. This Program Is Written, Compiled & Executed At TurboC/C++3.0 Compiler & Will Help You To Understand The Concept Of 'Heap Sort' From C++ Language. It Is A Well-Structured Program With Proper Comments Which Provides Step-By-Step Description Of Various Features Of The Language In A Simple & Easy-To-Understand Way. # Note : You Can Simply Copy-Paste The Following Program Or Code Into Compiler For Direct Result. C++ Program To Perform Heap Sort. /* Declaration Of Header Files */ #include<iostream.h> #include<conio.h> void hsort(int x[], int n); /* Start Of Main Program */ void main() { /* Declaration Of Variables */ int i, dim; int a[20]; clrscr(); /* Asking For The Input From User */ cout<<" \n Enter Dimension : "; cin>>dim; cout<<" \n Enter Values For Array : "; for(i=0;i<dim;i++) { cin>>a[i]; } cout<<" \n Entered Values Of Array Are : "; for(i=0;i<dim;i++) { cout<<a[i]<<"\t"; } hsort(a, dim); // Call To The Function. cout<<" \n After Heap Sort : "; for(i=0;i<dim;i++) { cout<<a[i]<<"\t"; } getch(); } /* End Of Main Program */ /* Source Code For Computing Heap Sort */ /* Start Of Heap Sort Function */ void hsort(int x[], int n) { int i, s, f, elt, ivalue; for(i=1;i<n;i++) { elt=x[i]; s=i; f=(s-1)/2; while(s>0 && x[f]<elt) { x[s]=x[f]; s=f; f=(s-1)/2; } x[s]=elt; } for(i=n-1;i>0;i--) { ivalue=x[i]; x[i]=x[0]; f=0; if(i==1) { s=-1; } else { s=1; } if( (i>2) && (x[2]>x[1]) ) { s=2; } while( (s>=0) && (ivalue<x[s]) ) { x[f]=x[s]; f=s; s=2*f+1; if( (s+1<=i-1) && (x[s]<x[s+1]) ) s=s+1; if(s>i-1) s=-1; } x[f]=ivalue; } } /* End Of Heap Sort Function */ Output : Enter Dimension : 5 Enter Values For Array : 3 1 5 2 4 After Heap Sort : 1 2 3 4 5 |
C++ Program To Perform Quick Sort. Posted: 04 Jun 2013 05:17 AM PDT This Post Contains A C++ Program To Perform Quick Sort With Correct Source Code, Algorithm & Output. This Program Is Written, Compiled & Executed At TurboC/C++3.0 Compiler & Will Help You To Understand The Concept Of 'Quick Sort' From C++ Language. It Is A Well-Structured Program With Proper Comments Which Provides Step-By-Step Description Of Various Features Of The Language In A Simple & Easy-To-Understand Way. # Note : You Can Simply Copy-Paste The Following Program Or Code Into Compiler For Direct Result. C++ Program To Perform Quick Sort. /* Declaration Of Header Files */ #include<iostream.h> #include<conio.h> int dim, a[10]; void qsort(int, int); /* Start Of Main Program */ void main() { /* Declaration Of Variables */ int i, l, r; clrscr(); /* Asking For The Input From User */ cout<<" \n Enter Dimension : "; cin>>dim; cout<<" \n Enter Values For Array : "; for(i=0;i<dim;i++) { cin>>a[i]; } cout<<" \n Entered Values Of Array Are : "; for(i=0;i<dim;i++) { cout<<a[i]<<"\t"; } l=0; r=dim-1; qsort(l, r); cout<<" \n After Quick Sort : "; for(i=0;i<dim;i++) { cout<<a[i]<<"\t"; } getch(); } /* Source Code For Computing Quick Sort */ void qsort(int left, int right) { int i, j, p, temp; if(right>left) { i=left; j=right; p=a[left]; while(right>left) { do { i++; } while( (a[i]<=p) && (i<=right) ); while( (a[j]>=p) && (j>left) ) { --j; } if(j>i) { temp=a[i]; a[i]=a[j]; a[j]=temp; } } temp=a[left]; a[left]=a[j]; a[j]=temp; qsort(left, j-1); qsort(i, right); } } /* End Of Main Program */ Output : Enter Dimension : 5 Enter Values For Array : 3 1 5 2 4 After Quick Sort : 1 2 3 4 5 |
C++ Program To Perform Insertion Sort In Ascending Order. Posted: 04 Jun 2013 05:09 AM PDT This Post Contains A C++ Program To Perform Insertion Sort In Ascending Order. With Correct Source Code, Algorithm & Output. This Program Is Written, Compiled & Executed At TurboC/C++3.0 Compiler & Will Help You To Understand The Concept Of 'Insertion Sort' From C++ Language. It Is A Well-Structured Program With Proper Comments Which Provides Step-By-Step Description Of Various Features Of The Language In A Simple & Easy-To-Understand Way. # Note : You Can Simply Copy-Paste The Following Program Or Code Into Compiler For Direct Result. C++ Program To Perform Insertion Sort In Ascending Order. /* Declaration Of Header Files */ #include<iostream.h> #include<conio.h> /* Start Of Main Program */ void main() { /* Declaration Of Variables */ int i, j, dim, val; int a[20]; clrscr(); /* Asking For The Input From User */ cout<<" \n Enter Dimension : "; cin>>dim; cout<<" \n Enter The Value : "; cin>>val; /* Source Code For Computing Insertion Sort In Ascending Order */ i=0; while(i<dim) { j=i-1; while(val<a[j] && j>=0) { a[j+1]=a[j]; --j; } a[j+1]=val; if(i != dim-1) { cout<<" \n Enter The Value : "; cin>>val; } } getch(); } /* End Of Main Program */ |
Mini Project :~ Sorting Techniques Using Functions #02. Posted: 04 Jun 2013 04:49 AM PDT This Post Contains A Mini Project :~ Sorting Techniques Using Functions #02 With Correct Source Code, Algorithm & Output. This Program Is Written, Compiled & Executed At TurboC/C++3.0 Compiler & Will Help You To Understand The Concept Of 'Quick Sort' & 'Merge Sort' From C Language. It Is A Well-Structured Program With Proper Comments Which Provides Step-By-Step Description Of Various Features Of The Language In A Simple & Easy-To-Understand Way. In The Following Program, We Would Perform Following Sorting Techniques Such As : 1. Quick Sort. 2. Merge Sort. # Note : You Can Simply Copy-Paste The Following Program Or Code Into Compiler For Direct Result. Program To Perform 'Quick' And 'Merge' Types Of Sorting Techniques Using Functions. /* Declaration Of Header Files */ #include<stdio.h> #include<conio.h> #include<stdlib.h> int a[100],b[100],l,k,No2=0,j,t,m,i; int Scan(int a[100]); int QuickS(int a[100],int ,int); void Disp1(); void Split(int,int); void MergeS(int ,int ,int); void Disp2(); /* Start Of Main Program */ void main() { int No1 = 0; clrscr(); printf("\n\t\t :: Welcome To 'Quick' And 'Merge' Types Of Sorting Program ::"); do // Displaying Menu Onto Screen. { printf("\n\nPlease Select One Of The Following Options ::"); printf("\n1. Quick Sorting"); printf("\n2. Merge Sorting"); printf("\n3. Exit From Menu"); printf("\nPlease Enter Your Choice Here ::\t"); scanf("%d",&No1); switch(No1) { case 1: No2 = (Scan(a)); l = 0; QuickS(a , l , No2); // Call To The Function. Disp1(); break; case 2: No2 = (Scan(a)); Split(0,No2-1); Disp2(); break; case 3: exit (0); break; default:printf("\nSorry!!! Invalid Choice"); } } while(No1 <= 3); getch(); } int Scan(int a[100]) { int i; printf("\nPlease Enter The Limit Of Array A ::\t"); scanf("%d",&No2); printf("\nPlease Enter The Elements For Array A ::\n"); for(i=0;i<No2;i++) { scanf("%d",&a[i]); } return (No2); } QuickS(int a[],int l,int No2) { if(l >= No2) return(0); k=l; i=l; j=No2; m=a[i]; do { do { i++; } while(a[i]<=m && i<No2); do { j--; } while(a[j]>=m && j>l); if(i<j) { t=a[i]; a[i]=a[j]; a[j]=t; } } while(i<j); t=a[j]; a[j]=m; a[k]=t; QuickS(a,l,j); QuickS(a,j+1,No2); return(0); } void Disp1() { printf("\nQuick Sorted Array A Is As Follows ::\n"); for(i=0;i<No2;i++) { printf("%d \n",a[i]); } } void MergeS(int low,int mid,int high) { int i,h,j,k; i=low; h=low; j=mid+1; while(h <= mid && j <= high) { if(a[h] < a[j]) { b[i] = a[h]; h++; } else { b[i] = a[j]; j++; } i++; } if( h > mid ) { for(k=j ; k <= high ; k++) { b[i] = a[k]; i++; } } else { for(k=h ; k<= high ; k++) { b[i] =a[k]; i++; } } for(k=low ; k <= high ; k++) a[k] = b[k]; } void Split(int low,int high) { int mid; if(low<high) { mid = (low+high)/2; Split(low,mid); Split(mid+1,high); MergeS(low,mid,high); // Call To The Function. } } void Disp2() { printf("\nMerge Sorted Array A Is As Follows ::\n"); for(i=0;i<No2;i++) { printf("%d \n",a[i]); } } /* End Of Main Program */ Output :~ Please Select One Of The Following Options :: 1. Quick Sorting 2. Merge Sorting 3. Exit From Menu Please Enter Your Choice Here :: 1 Please Enter The Limit Of Array A :: 8 Please Enter The Elements For Array A :: 7 4 1 0 6 2 8 5 Quick Sorted Array Is As Follows :: 0 1 2 4 5 6 7 8 Please Select One Of The Following Options :: 1. Quick Sorting 2. Merge Sorting 3. Exit From Menu Please Enter Your Choice Here :: 2 Please Enter The Limit Of Array A :: 10 Please Enter The Elements For Array A :: 7 4 1 0 6 2 8 5 9 3 Merge Sorted Array Is As Follows :: 0 1 2 3 4 5 6 7 8 9 Please Select One Of The Following Options :: 1. Quick Sorting 2. Merge Sorting 3. Exit From Menu Please Enter Your Choice Here :: 3 |
You are subscribed to email updates from Most Commonly Asked Programs In 'C' & 'C++' Language. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google Inc., 20 West Kinzie, Chicago IL USA 60610 |
Post a Comment