Here you will learn about stack in C++ using a program example. Stack is an abstract datatype which follows Last In First Out (LIFO) principle. Basically stack has two operations namely push and pop. push: inserting an element at the top of the stack pop: removing an element from the top of the stack Below …
#include<iostream.h> #include<conio.h>void main() { clrscr(); int a,b; cout<<“Enter value of a:”; cin>>a; cout<<“Enter value of b:”; cin>>b; a=a+b; b=a-b; a=a-b; cout<<“na=”<<a; cout<<“nb=”<<b; getch(); }
Here is the C++ program to print upperhalf and lowerhalf triangle of a square matrix. #include<iostream> using namespace std; int main() { int a[10][10],i,j,m; cout<<“Enter size of the Matrix(min:3,max:5):”; cin>>m; cout<<“\nEnter the Matrix row wise:\n”; for(i=0;i<m;i++) for(j=0;j<m;++j) cin>>a[i][j]; cout<<“\n\n”; for(i=0;i<m;++i) { for(j=0;j<m;++j) { if(i<j) cout<<a[i][j]<<” “; else cout<<” “; } cout<<“\n”; } cout<<“\n\n”; for(i=0;i<m;++i) { …
C++ Program to Print Upperhalf and Lowerhalf Triangle of Square Matrix Read More »
Here is the C++ program to find largest and second largest number in a 2d array or matrix. #include<iostream> using namespace std; int main() { int a[5][5],big1=1,big2=0,n,m,i,j; cout<<“Enter no of rows and columns(max 5):”; cin>>m>>n; cout<<“Enter the array:\n”; for(i=0;i<m;i++) for(j=0;j<n;++j) cin>>a[i][j]; for(i=0;i<m;++i) for(j=0;j<n;++j) { if(a[i][j]>big1) big1=a[i][j]; } for(i=0;i<m;++i) for(j=0;j<n;++j) { if(a[i][j]>big2&&a[i][j]<big1) big2=a[i][j]; } cout<<“\nLargest number:”<<big1; …
C++ Program to Find Largest and Second Largest Number in 2D Array Read More »
Here is the C++ program to find the sum of diagonals of a matrix. The matrix should be a square matrix. #include<iostream> using namespace std; int main() { int a[5][5],d1sum=0,d2sum=0,m,i,j; cout<<“Enter size of the square matrix(max 5):”; cin>>m; cout<<“\nEnter the Matrix row wise:\n”; for(i=0;i<m;i++) for(j=0;j<m;++j) cin>>a[i][j]; for(i=0;i<m;++i) for(j=0;j<m;++j) { if(i==j) d1sum+=a[i][j]; if(i+j==(m-1)) d2sum+=a[i][j]; } cout<<“\nSum …
In this article you will get program for bubble sort in C++. Bubble sort is a sorting technique in which each pair of adjacent elements are compared, if they are in wrong order we swap them. This algorithm is named as bubble sort because, same as like bubbles the smaller or lighter elements comes up …
This is a C++ program to delete an element from array. The user input an element to delete, the element is then searched in the array, if it is found it is deleted and new array is displayed. If the element is not present in the array then a not found message is displayed. #include<iostream> …
#include<conio.h> #include<graphics.h> #include<dos.h> #include<process.h> #include<iostream.h> int calculatehrs(int h) { int x; switch(h) { case 0: x=90; break; case 1: case 13: x=60; break; case 2: case 14: x=30; break; case 3: case 15: x=0; break; case 4: case 16: x=330; break; case 5: case 17: x=300; break; case 6: case 18: x=270; break; case 7: …
