Program 1 // Program for linear sort #include<iostream> #define clrscr() system(“cls”) using namespace std; class Sort { public: void sort(int ar[],int n) { int i,j,temp; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(ar[j]<ar[i]) { temp=ar[i]; ar[i]=ar[j]; ar[j]=temp;...
Program 1 // Program for Recursion #include<conio.h> #include<iostream> #define clrscr() system(“cls”) using namespace std; int main() { static int i=1; int n; if(i==1) clrscr(); if(i>10) exit(0); cout<<i*i<<“\n”; i++; main(); return 0; } Program 2...
Program 1 // Program for Binary Search in Data Structure #include<iostream> #define clrscr() system(“cls”) using namespace std; class Search { public: int binarySearch(int ar[],int n,int s); }; int Search::binarySearch(int ar[],int n,int s) { int...
Program 1 // Circular double linked list code #include<iostream> #include<stdio.h> #define clrscr() system(“cls”) using namespace std; class node { public: node *ladd; int data; node *radd; }; int count=0; node *start=NULL,*new1,*temp,*prv,*nxt; void create(); void...
program 1 // Circular Linked list #include<iostream> #include<stdio.h> #define clrscr() system(“cls”) using namespace std; class Node { public: int data; Node *add; }; Node *start=NULL,*new1,*temp,*prv,*nxt,*last; int count=0; void create(); void display(); void insertFirst(); void...
Program 1 // Priority Queue #include<iostream> #include<stdio.h> #define clrscr() system(“cls”) using namespace std; class node { public: int data; int p; node *add; }; node *start=NULL,*new1,*temp; void create(); void insert(); void display(); void delete1();...
Program 1 #include<iostream> #define MAXSIZE 10 #define clrscr() system(“cls”) using namespace std; class MyCqueue { private: int rear,front; int cq[MAXSIZE]; public: MyCqueue() { rear=-1; front=-1; } void insert(); void delete1(); void display(); }; void...
