Program 1 // Shall Sort Implementation #include<iostream> #define clrscr() system(“cls”) using namespace std; int main() { int a[500],n,i,j,gap,temp; clrscr(); xyz:cout<<“\nEnter the limit of array”; cin>>n; if(n>500) { cout<<“\nInvalid limit enter again”; goto xyz; }...
Program 1 // Implementation of Selection Sort #include<iostream> using namespace std; int main() { system(“cls”); int ar[500],n,i,j,temp,min,loc; cout<<“\n Enter the limit: “; cin>>n; if(n<0 || n>500) cout<<“\n Invalid limit”; else { cout<<“\n Enter elements...
Program 1 // Recursion Implementation #include<iostream> #define MAXSIZE 5 using namespace std; int factorial(int n); int main() { system(“cls”); int n,f; cout<<“\n Enter the number”; cin>>n; f=factorial(n); cout<<“\n Factorial is : “<<f; return 0;...
Program 1 // Program for Quick Sort #include<stdio.h> #include<conio.h> #include<iostream> #define clrscr() system(“cls”) using namespace std; void quick_sort(int ar[],int l ,int h); int main() { clrscr(); int ar[500],n,low,high; int i; xyz:cout<<“\nEnter the limit”; cin>>n;...
Program 1 // Implementation of Insertion Sort #include<iostream> using namespace std; int main() { int ar[500],n,i,j,k,temp; system(“cls”); cout<<“\n Enter limit: “; cin>>n; if(n<0 || n>500) cout<<“\n Invalid limit”; else { cout<<“\n Enter “<< n<<“...
Program 1 // Implementation of Bubble Sort #include<iostream> using namespace std; int main() { system(“cls”); int ar[500],n,i,j,temp; cout<<“Enter the limit: “; cin>>n; cout<<“\n Enter the elements: “; for(i=0;i<n;i++) cin>>ar[i]; for(i=0;i<n;i++) { for(j=0;j<n-i-1;j++) { if(ar[j]>ar[j+1])...
Program 1 // Linear Sort #include<iostream> #include<stdio.h> using namespace std; int main() { system(“cls”); int ar[500],n,i,j,temp; cout<<“\n Enter the limit: “; cin>>n; cout<<“\n Enter elements in array: “; for(i=0;i<n;i++) cin>>ar[i]; // sorting for(i=0;i<n;i++) {...
Program 1 //Binary Search #include<iostream> #include<stdio.h> using namespace std; int main() { system(“cls”); int ar[500],n,i,j,s,temp,low,high,mid,flag=0; cout<<“\n Enter the limit of array: “; cin>>n; cout<<“\n Enter elements in array: “; for(int i=0;i<n;i++) cin>>ar[i]; // Sorting...
Program 1 // Linear Search #include<iostream> #include<stdio.h> using namespace std; class Search { int myarrray[1000],s,len; public: Search(int myar[],int mys,int l) { for(int i=0;i<l;i++) { myarrray[i]=myar[i]; } s=mys; len=l; } int mysearch() { int i;...
Program 1 // Circular Double Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { Node *ladd; int data; Node *radd; public: void create(); void display(); void reverseDisplay(); void insert_first(); void insert_middle(); void insert_last();...
