Write a program to Implement a Linked List in C++

The user is provided with the following options..



To insert an item at begining

To insert an item at end

To insert an item at position

To traverse the list

To delete first item

To delete last item

To delete item from position

To count no. of items in list

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<conio.h>


2. #include<stdio.h>


3. #include<alloc.h>


4. #include<process.h>


5. struct node


6. { int info;


7. struct node *next;


8. };




10. typedef struct node sn;




12. void insertatbeg(sn **,int);


13. void insertatend(sn **,int);


14. void insertatpos(sn **,int,int);


15. void traverse(sn *);


16. int delfirst(sn *);


17. int dellast(sn *);


18. int delpos(sn *,int);


19. int count(sn *);


20. //Coding by: Snehil Khanor


21. //http://WapCPP.blogspot.com


22. void main()


23. { sn *p;


24. int n,i,l;


25. char ch;


26. clrscr();


27. p=NULL;


28. do


29. { printf("\n-----select an operation-----");


30. printf("\n1->To insert an item at begining<-");


31. printf("\n2->To insert an item at end<-");


32. printf("\n3->To insert an item at position<-");


33. printf("\n4->To traverse the list<-");


34. printf("\n5->To delete first item<-");


35. printf("\n6->To delete last item<-");


36. printf("\n7->To delete item from position<-");


37. printf("\n8->To count no. of items in list<-");


38. printf("\n9->Exit<-");


39. printf("\n->Enter your choice:");


40. scanf("%d",&n);


41. switch(n)


42. { case 1:printf("\n->Enter the item to insert");


43. scanf("%d",&i);


44. insertatbeg(&p,i);


45. break;


46. case 2:printf("\n->Enter the item to insert");


47. scanf("%d",&i);


48. insertatend(&p,i);


49. break;


50. case 3:printf("\n->Enter the item to insert");


51. scanf("%d",&i);


52. printf("\n->Enter the position");


53. scanf("%d",&l);


54. insertatpos(&p,i,l);


55. break;


56. case 4:traverse(p);


57. break;


58. case 5:i=delfirst(p);


59. printf("\nItem deleted is %d.",i);


60. break;


61. case 6:i=dellast(p);


62. printf("\nItem deleted is %d.",i);


63. break;


64. case 7:printf("\n->Enter the position");


65. scanf("%d",&l);


66. i=delpos(p,l);


67. printf("\nItem deleted is %d.",i);


68. break;


69. case 8:i=count(p);


70. printf("\nNumber of nodes in list are %d.",i);


71. break;


72. case 9:exit(0);


73. break;


74. default:printf("\n->You have entered wrong choice");


75. }


76. printf("\n->Do you want to continue/exit(y/n)");


77. fflush(stdin);


78. scanf("%c",&ch);


79. } while((ch=='y')||(ch=='Y'));


80. getch();


81. }




83. int count(sn *p)


84. { sn *temp;


85. int c=1;


86. temp=p;


87. while((temp->next)!=NULL)


88. { c++;


89. temp=temp->next;


90. }


91. return c;


92. }




94. void insertatbeg(sn **p,int item)


95. { sn *ptr;


96. ptr=(sn *)malloc(sizeof(sn));


97. ptr->info=item;


98. if(*p==NULL)


99. ptr->next=NULL;


100. else


101. ptr->next=*p;


102. *p=ptr;


103. }




105. void insertatend(sn **p,int item)


106. { sn *ptr,*temp;


107. ptr=(sn *)malloc(sizeof(sn));


108. ptr->info=item;


109. ptr->next=NULL;


110. if(*p==NULL)


111. *p=ptr;


112. else


113. { temp=*p;


114. while((temp->next)!=NULL)


115. temp=temp->next;


116. temp->next=ptr;


117. }


118. }




120. void insertatpos(sn **p,int item,int loc)


121. { sn *ptr,*temp,*s;


122. int i,c;


123. temp=*p;


124. ptr=(sn *)malloc(sizeof(sn));


125. ptr->info=item;


126. c=count(*p);


127. if(loc>c)


128. printf("\nList is short,Item can't inserted");


129. else


130. {


131. for(i=0;i<loc-1;i++)


132. { s=temp;


133. temp=temp->next;


134. }


135. ptr->next=s->next;


136. s->next=ptr;


137. }


138. }




140. //Coding by: Snehil Khanor


141. //http://WapCPP.blogspot.com


142. void traverse(sn *p)


143. { sn *temp;


144. if(p==NULL)


145. printf("\nList is empty.");


146. else


147. {


148. temp=p;


149. while((temp->next)!=NULL)


150. { printf("\nno.=%d",temp->info);


151. temp=temp->next;


152. }


153. printf("\nno.=%d",temp->info);


154. }


155. }




157. int delfirst(sn *p)


158. { int item;


159. sn *temp;


160. if(p==NULL)


161. { printf("\nList is empty");


162. return 0;


163. }


164. else


165. { temp=p;


166. p=p->next;


167. item=temp->info;


168. free(temp);


169. return item;


170. }


171. }




173. int dellast(sn *p)


174. { int item;


175. sn *temp,*s;


176. if(p==NULL)


177. { printf("\nList is empty");


178. return 0;


179. }


180. else


181. { temp=p;


182. while((temp->next)!=NULL)


183. { s=temp;


184. temp=temp->next;


185. }


186. item=temp->info;


187. s->next=NULL;


188. free(temp);


189. return item;


190. }


191. }




193. int delpos(sn *p,int loc)


194. { int item,i,c;


195. sn *temp,*s;


196. c=count(p);


197. if(p==NULL)


198. { printf("\nList is empty");


199. return 0;


200. }


201. else


202. { if(loc>c)


203. { printf("\nItem is not in list.");


204. return 0;


205. }


206. else


207. { temp=p;


208. for(i=0;i<loc-1;i++)


209. { s=temp;


210. temp=temp->next;


211. }


212. item=temp->info;


213. s->next=temp->next;


214. free(temp);


215. return item;


216. }


217. }


218. }

Write a program to Implement a Queue in C++

User is asked to Insert into.. Delete from or Display the entire queue..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 


2. #include<conio.h> 


3. #include<process.h> 


4. int queue[5]; 


5. long front,rear; 


6. void initqueue(); 


7. void display(); 


8. void main() 


9. { 


10. int choice,info; 


11. clrscr(); 


12. while(1) 


13. { 


14. clrscr(); 


15. printf(" MENU \n"); 


16. printf("1.Insert an element in queue\n"); 


17. printf("2.Delete an element from queue\n"); 


18. printf("3.Display the queue\n"); 


19. printf("4.Exit!\n"); 


20. printf("Your choice: "); 


21. scanf("%i",&choice); 


22. //Coding by: Snehil Khanor  


23. //http://WapCPP.blogspot.com  


24. switch(choice) 


25. { 


26. case 1:if(rear<4) 


27. { 


28. printf("enter the number: "); 


29. scanf("%d",&info); 


30. if (front==-1) 


31. { 


32. front=0; 


33. rear=0; 


34. } 


35. else 


36. rear=rear+1; 


37. queue[rear]=info; 


38. } 


39. else 


40. printf("queue is full"); 


41. getch(); 


42. break; 


43. case 2: int info; 


44. if(front!=-1) 


45. { 


46. info=queue[front]; 


47. if(front==rear) 


48. { 


49. front=-1; 


50. rear=-1; 


51. } 


52. else 


53. front=front+1; 


54. printf("no deleted is = %d",info); 


55. } 


56. else 


57. printf("queue is empty"); 


58. getch(); 


59. break; 


60. case 3: display(); 


61. getch(); 


62. break; 


63. case 4: exit(1); 


64. break; 


65. default:printf("You entered wrong choice!"); 


66. getch(); 


67. break; 


68. } 


69. } 


70. } 


71. void initqueue() 


72. { 


73. front=rear=-1; 


74. } 


75. void display() 


76. { 


77. int i; 


78. for(i=front;i<=rear;i++) 


79. printf("%i\n",queue[i]); 


80. } 

Write a program to Implement a stack in C++

User is asked to PUSH, POP , or TRAVERSE.. PUSH is to add items to the Stack, POP is to remove item from the Stack, and TRAVERSE is to traverse the whole Stack

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 


2. #include<conio.h> 


3. #include<process.h> 


4. #define MAXSIZE 10 


5. void push(); 


6. int pop(); 


7. void traverse(); 


8. int stack[MAXSIZE]; 


9. int Top=-1; 


10. void main() 


11. { 


12. int choice; 


13. char ch; 


14. do 


15. { 


16. clrscr(); 


17. printf("\n1. PUSH "); 


18. printf("\n2. POP "); 


19. printf("\n3. TRAVERSE "); 


20. printf("\nEnter your choice "); 


21. scanf("%d",&choice); 


22. switch(choice) 


23. { 


24. case 1: push(); 


25. break; 


26. case 2: printf("\nThe deleted element is %d ",pop()); 


27. break; 


28. case 3: traverse(); 


29. break; 


30. default: printf("\nYou Entered Wrong Choice"); 


31. } 


32. printf("\nDo You Wish To Continue (Y/N)"); 


33. fflush(stdin); 


34. scanf("%c",&ch); 


35. } 


36. while(ch=='Y' || ch=='y'); 


37. } 


38. //Coding by: Snehil Khanor  


39. //http://WapCPP.blogspot.com  


40. void push() 


41. { 


42. int item; 


43. if(Top == MAXSIZE - 1) 


44. { 


45. printf("\nThe Stack Is Full"); 


46. getch(); 


47. exit(0); 


48. } 


49. else 


50. { 


51. printf("Enter the element to be inserted "); 


52. scanf("%d",&item); 


53. Top= Top+1; 


54. stack[Top] = item; 


55. } 


56. } 


57.  


58. int pop() 


59. { 


60. int item; 


61. if(Top == -1) 


62. { 


63. printf("The stack is Empty"); 


64. getch(); 


65. exit(0); 


66. } 


67. else 


68. { 


69. item = stack[Top]; 


70. Top = Top-1; 


71. } 


72. return(item); 


73. } 


74.  


75. void traverse() 


76. { 


77. int i; 


78. if(Top == -1) 


79. { 


80. printf("The Stack is Empty"); 


81. getch(); 


82. exit(0); 


83. } 


84. else 


85. { 


86. for(i=Top;i>=0;i--) 


87. { 


88. printf("Traverse the element "); 


89. printf("%d\n",stack[i]); 


90. } 


91. } 


92. } 

Write a program to sort elements of array using Selection Sorting

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 


2. #include<conio.h> 


3. void main() 


4. { 


5. int a[100],n,i,j,temp,loc,min; 


6. clrscr(); 


7. printf("\How many elements:\n"); 


8. scanf("%d",&n); 


9. printf("Enter the element of array\n"); 


10. for(i=0;i<=n-1;i++) 


11. { 


12. scanf("%d",&a[i]); 


13. } 


14. min=a[0]; 


15. //Coding by: Snehil Khanor  


16. //http://WapCPP.blogspot.com  


17. for(i=0;i<=n-1;i++) 


18. { 


19. min=a[i]; 


20. loc=i; 


21. for(j=i+1;j<=n-1;j++) 


22. { 


23. if(a[j]<min) 


24. { 


25. min=a[j]; 


26. loc=j; 


27. } 


28. } 


29. if(loc!=1) 


30. { 


31. temp=a[i]; 


32. a[i]=a[loc]; 


33. a[loc]=temp; 


34. } 


35.  


36. } 


37. printf("The number after selection sorting are:\n"); 


38. for(i=0;i<=n-1;i++) 


39. { 


40. printf("%d\n",a[i]); 


41. } 


42. getch(); 


43. } 

Write a program to sort elements of array using Quick Sort

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 


2. #include<conio.h> 


3. #define max 100 


4. int a[max],n,i,l,h; 


5. void main() 


6. { 


7. void input(void); 


8. input(); 


9. getch(); 


10. } 


11.  


12. void input(void) 


13. { 


14. void output(int a[],int n); 


15. void quick_sort(int a[],int l,int h); 


16. printf("How many elements in the array : "); 


17. scanf("%d",&n); 


18. printf("\n"); 


19. printf("Enter the elemennts : \n"); 


20. for(i=0;i<=n-1;i++) 


21. { 


22. scanf("%d",&a[i]); 


23. } 


24. l=0; 


25. h=n-1; 


26. quick_sort(a,l,h); 


27. printf("Sorted Array :\n "); 


28. output(a,n); 


29. } 


30.  


31. void quick_sort(int a[],int l, int h) 


32. { 


33. int temp,key,low,high; 


34. low=l; 


35. high=h; 


36. key=a[(low+high)/2]; 


37. do 


38. { 


39. while(key>a[low]) 


40. { 


41. low++; 


42. } 


43. while(key<a[high]) 


44. { 


45. high--; 


46. } 


47. if(low<=high) 


48. { 


49. temp=a[low]; 


50. a[low++]=a[high]; 


51. a[high--]=temp; 


52. } 


53. //Coding by: Snehil Khanor 


54. //http://WapCPP.blogspot.com 


55. } while(low<=high); 


56. if(l<high) 


57. quick_sort(a,l,high); 


58. if(low<h) 


59. quick_sort(a,low,h); 


60. } 


61. void output(int a[],int n) 


62. { 


63. for(i=0;i<=n-1;i++) 


64. { 


65. printf("%d\n",a[i]); 


66. } 


67. }

Write a program to sort elements of array (bubble Sorting)

Size of array is taken from user.. Elemnts are entered by user.. Elements are sorted in ascending order..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<conio.h>


2. #include<iostream.h>


3. void main()


4. {


5. clrscr();


6. int a[100],i,n,j,temp;


7. cout<<"How many element: ";


8. cin>>n;


9. cout<<"Enter the elements of array: "<<endl;


10. for(i=0;i<n;i++)


11. cin>>a[i];


12. cout<<"The elements of array Before Sorting: "<<endl;


13. //Coding by: Snehil Khanor


14. //http://WapCPP.blogspot.com


15. for(i=0;i<n;i++)


16. cout<<a[i]<<" ";


17. cout<<endl;


18. for(i=0;i<n;i++)


19. {


20. for(j=0;j<n-1-i;j++)


21. {


22. if(a[j]>a[j+1])


23. {


24. temp=a[j];


25. a[j]=a[j+1];


26. a[j+1]=temp;


27. }


28. }


29. }


30. cout<<"Elements of array After Sorting: "<<endl;


31. for(i=0;i<n;i++)


32. cout<<a[i]<<" ";


33. getch();


34. }

Write a program to search an element in an array (Binary searching)

Size of array is taken from user.. Elements are entered by user in order (ascending or descending).. user is asked for the element to be searched... Search is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<conio.h>


2. #include<iostream.h>


3. void main()


4. {


5. clrscr();


6. int a[100],i,loc,mid,beg,end,n,flag=0,item;


7. cout<<"How many element: ";


8. cin>>n;


9. cout<<"Enter (IN ORDER) the elements of array: "<<endl;


10. //Coding by: Snehil Khanor


11. //http://WapCPP.blogspot.com


12. for(i=0;i<n;i++)


13. cin>>a[i];


14. cout<<"Enter the element to be searched: ";


15. cin>>item;


16. loc=0;


17. beg=0;


18. end=n-1;


19. while((beg<=end)&&(item!=a[mid]))


20. {


21. mid=(beg+end)/2;


22. if(item==a[mid])


23. {


24. cout<<"Search successful :)";


25. loc=mid;


26. cout<<"Position of the Item: "<<loc+1;


27. flag=flag+1;


28. }


29. else if(item<a[mid])


30. end=mid-1;


31. else


32. beg=mid+1;


33. }


34. if(flag==0)


35. {


36. cout<<"Search NOT sucessfull :( ";


37. }


38. getch();


39. }

Write a program to search an element in an array (Linear searching)

Size of array is taken from user.. Elements are entered.. Then user is asked to enter element to be searched.. Search is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<iostream.h>


2. #include<conio.h>


3. void main()


4. {


5. clrscr();


6. int ar[10],n,num,no;


7. cout<<"Enter size of the array: ";


8. cin>>n;


9. cout<<"Enter array element: "<<endl;


10. for(int i=0;i<n;i++)


11. {


12. cout<<"Enter element "<<i<<": ";


13. cin>>ar[i];


14. }


15. //Coding by: Snehil Khanor


16. //http://WapCPP.blogspot.com


17. cout<<"Elements of array: "<<endl;


18. for(i=0;i<n;i++)


19. cout<<"Element at index number "<<i<<" is: "<<ar[i]<<endl;


20. //////To search////


21. cout<<"Enter number to search: ";


22. cin>>num;


23. for(i=0;i<n;i++)


24. {


25. if(num==ar[i])


26. {


27. cout<<"Found at index number: "<<i;


28. no=0;


29. break;


30. }


31. else


32. {


33. no=1;


34. continue;


35. }


36. }


37. if(no==1)


38. cout<<"Sorry your search returned NO results. :(";


39. getch();


40. }