PROGRAMMING EXAMPLES

CODING: #include<stdio.h> #include<conio.h> int partition(int list[],int beg,int end); void quick_sort(int list[],int beg,int end); void main() { int arry[50],i,n; clrscr(); printf("How many enter the element:"); scanf("%d",&n); for(i=0;i<n;i++)  {   printf("Enter the number:");   scanf("%d",&arry[i]);  } quick_sort(arry,0,n-1); printf("YOUR SORTED LIST:\n");  for(i=0;i<n;i++) printf("%d\n",arry[i]); getch(); } void quick_sort(int list[],int beg,int end) { int loc; if(beg<end)  {  loc=partition(list,beg,end);  quick_sort(list,beg,loc-1);  quick_sort(list,loc+1,end);  } } int partition(int list[],int beg,int end) { int left,right,temp,loc,flag; loc=left=beg; right=end; flag=0; while(flag!=1) {  while((list[loc]<=list[right]) && (loc!=right))     right--;   if(loc==right)     flag=1;   else if(list[loc]>list[right])    {     temp=list[loc];

CODING: #include<stdio.h> #include<conio.h> #include<malloc.h> struct stack { int no; struct stack *next; }; struct stack *top=NULL; struct stack *push(struct stack *,int); struct stack *pop(struct stack *); struct stack *update(struct stack *); struct stack *display(struct stack *); int peep(struct stack *); void main() { int val,ch; clrscr(); do {  printf("\n\nS E L E C T  O P E R A T I O N");  printf("\n1.PUSH");  printf("\n2.POP");  printf("\n3.PEEP");  printf("\n4.UPDATE");  printf("\n5.DISPLAY");  printf("\n6.EXIT");  printf("\nEnter The option:");  scanf("%d",&ch);  switch(ch)  {  case 1:  printf("\nEnter the number to be pushed on to the stack:");  scanf("%d",&val);  top=push(top,val);  break;  case 2:  top=pop(top);  break;  case 3:  val=peep(top);  printf("\nThe value stored at the top of the st

#include<stdio.h> #include<conio.h> #define max 10 int  st[max],top=-1; void push(int st[],int val); int  pop(int st[]); int  peep(int st[]); int  update(int st[]); void display(int st[]); void main() { int  val,ch; clrscr(); do { printf("\nS E L E C T  O P E R A T I O N\n"); printf("\n1.PUSH"); printf("\n2.POP"); printf("\n3.PEEK"); printf("\n4.UPDATE"); printf("\n5.OPEN"); printf("\n6.EXITE"); printf("\nEnter The option:");  scanf("%d",&ch); switch(ch) { case 1:  printf("Enter the number to be pushed on to the stack:");  scanf("%d",&val);  push(st,val);  break; case 2:  val=pop(st);  printf("\nThe Value deleted from the stack is:%d",val);  break; case 3:  val=peep(st);  printf("\nThe Value stored at the top of the stack is:%d",val);  break; case 4:  val=update(st);  printf("\nThe value is u

CODING: #include<stdio.h> #include<conio.h> void merge(int a[],int,int,int); void merge_sort(int a[],int,int); void main() { int arry[50],i,n; clrscr(); printf("How many enter the number:"); scanf("%d",&n); for(i=0;i<n;i++) { printf("Enter the number:"); scanf("%d",&arry[i]); } merge_sort(arry,0,n-1); printf("\nSorted The List."); for(i=0;i<n;i++) printf("\n%d",arry[i]); getch(); } void merge_sort(int arry[],int beg,int end) { int i,mid; if(beg<end) {  mid=(beg+end)/2;  merge_sort(arry,beg,mid);  merge_sort(arry,mid+1,end);  merge(arry,beg,mid,end); } } void merge(int arry[],int beg,int mid,int end) { int i=beg,j=mid+1,ii=beg,temp[50],k; while((i<=mid) && (j<=end)) {  if(arry[i]<arry[j])  {   temp[ii]=arry[i];   i++;  }  else  {   temp[ii]=arry[j];   j++;  }  ii++; } if(i>mid) {  while(j<=end)  {   temp[ii]=arry[j];   j+

A RRAY 1. C Program to Sort the Array in an Ascending Order. 2. C Program to Sort the Array in an descending Order. S EARCHING 1. Linear Search in C program.   2. Binary Search in  C program.   S ORTING   1. Alphabetical Sort in C program.     2. Bubble Sort in C program.     3. Selection Sort using function in C program.       4. Insertion Sort using function in C program.     5. Merge Sort using function in C program.     6. Quick Sort using function in C program.     7. Cocktail Sort in C program.     8. Gnome Sort in C program.     9. Heap Sort in C program.   10. Shell Sort in C program.   L INK LIST 1. Singly Linked List to implement Insertions,Deletions,Traversal,Splitting,Merging,Counting Node & Sorting in C program.   2. Doubly Linked List to implement Insertions,Deletions,Traversal,Splitting,Merging,Counting Node & Sorting in C program.   S TACK 1. Stack Array to implement Push, Pop, Peep & Update operations.   2. Linked Stack to impl

I NTRODUCTION TO OOP,CLASSES & OBJECTS 1. Use of scope Resolution of Operators. 2. Define a function outside a using scope resolution operators. 3. Write a program to calculate the area of circle, rectangle and square using function overloading. 4. Write a program to calculate the area of circle, rectangle and square using with class & object. 5. Write a program to demonstrate the use of returning a reference variable. 6. Create a class student,stores the details about name,roll no,marks of 5 subject,1.get function accept value of data members,2. display function to display,3.total function to return total of 5 subjects marks. 7. Create function power() in c++. & Create function power() in c++ and default argument. 8. Write a C++ program to swap the value of private data members from 2 different classes. 9. Write a program to illustrate the use of this pointer. 10. An election is contested by five candidates. The candidates are numbered 1 to 5 and the voting is do

1.Write a program to print a string in C language #include<stdio.h> #include<conio.h> main() { clrscr(); printf("\nKodeGod.com"); getch(); } 2.Write a program to accept values of two numbers and print their addition #include<stdio.h> #include<conio.h> main() { int a,b,c; clrscr(); printf("Enter number 1: "); scanf("%d",&a); printf("Enter number 2: "); scanf("%d",&b); c=a+b; printf("Addition is : %d",c); getch(); } 3.Write a program to accept values of two numbers and print their subtraction  #include<stdio.h> #include<conio.h> main() { int a,b,c; clrscr(); printf("Enter number 1: "); scanf("%d",&a); printf("Enter number 2: "); scanf("%d",&b); c=a-b; printf("Subtraction : %d",c); getch(); } 4.Write a program to accept values of two numbers and print their multiplication in C langua