#include<iostream>
using namespace std;

void swap(int *x, int *y)
{
int temp = *x;
*x = *y;
*y = temp;
}

int partition(int arr[], int start, int end)
{
int pivot = arr[end];
int i,j;

j = start;
for (i = start; i < end; i++)
{
if (arr[i] <= pivot)
{
swap(&arr[i], &arr[j]);
j++;
}

}
swap(&arr[j], &arr[end]);
return j;
}

void quicksort(int arr[], int start, int end)
{
int part;

if (start < end)
{
part = partition(arr, start, end);

quicksort(arr, start, part - 1);
quicksort(arr, part + 1, end);
}
}

int main()
{
int size;
cout<<"\n Enter the size of the array : ";
cin>>size;

int arr[size];

cout<<"\n Enter "<<size<<" elements in the array : ";
for (int i = 0; i < size; i++)
{
cin>>arr[i];
}

quicksort(arr, 0, size - 1);

cout<<"\n Sorted Array : ";
for (int i = 0; i < size; i++)
{
cout<<arr[i]<<" ";
}

return 0;
}

//Selection Sort Program
#include<iostream>
using namespace std;

#include<conio.h>

void SelectionSort(int arr[], int size)
{
int min,pos;
for (int i = 0; i < size - 1; i++)
{
min = arr[i];
pos = i;
//Finding the smallest element
for (int j = i + 1; j < size; j++)
{
if (arr[j] < min)
{
min = arr[j];
pos = j;
}
}
//Swaping the smallest element to its accurate position
arr[pos] = arr[i];
arr[i] = min;
}
}

int main()
{
int size;

cout<<"\n Enter the size of the array : ";
cin>>size;

int arr[size];

cout<<"\n Enter the Elements in the array : ";
for (int i = 0; i < size; i++)
{
cin>>arr[i];
}

SelectionSort(arr, size);

cout<<"\n Sorted Array : ";
for (int i = 0; i < size; i++)
{
cout<<arr[i]<<" ";
}

getch();
return 0;
}

//Bubble Sort Program
#include<iostream>
using namespace std;
#include<conio.h>

//Function of Bubble Sort
void BubbleSort(int arr[], int size)
{
int temp;

for (int i = 0; i < size - 1; i++)
{
for (int j = 0; j < size - i - 1; j++)
{
if (arr[j] > arr[j+1])
{
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1]=temp;
}
}
}
}
int main()
{
int size;

cout<<"\n Enter the size of the array : ";
cin>>size;

int arr[size];

cout<<"\n Enter the elements to be sorted : ";
for (int i = 0; i < size; i++)
{
cin>>arr[i];
}

BubbleSort(arr, size);

cout<<"\n Sorted Array : ";
for (int i = 0; i < size; i++)
{
cout<<arr[i]<<" ";
}

getch();
return 0;
}

//Binary Search Tree Program
#include <iostream>
using namespace std;

//Node
struct Node
{
int data;
Node* left, *right;
}*root = NULL;

// Finding position for the current node and Inserting it
void Insert_In_Tree(Node* ptr, Node* newnode)
{

if (root == NULL)
{
root = newnode;
}

else
{
if (newnode->data <= ptr->data)
{
if (ptr->left == NULL)
{
ptr->left = newnode;
}

else
{
Insert_In_Tree(ptr->left, newnode);
}
}

else
{
if(ptr->right == NULL)
{
ptr->right = newnode;

}

else
{
Insert_In_Tree(ptr->right, newnode);
}
}
}

return;
}


//Node creation for Tree
void MakeNode(int arr[], int size)
{
Node *newnode;
for (int i = 0; i < size; i++)
{
newnode = new Node;
newnode->data=arr[i];
newnode->left = newnode->right = NULL;
Insert_In_Tree(root, newnode);
}

}

//Simple Binary Tree Traversal Functions.
void preorder(Node *ptr)
{
if (ptr==NULL)
{
return;
}
else
{
cout<<ptr->data<<" ";
preorder(ptr->left);
preorder(ptr->right);
}
}

void Inorder(Node *ptr)
{
if(ptr==NULL)
{
return;
}
else
{
Inorder(ptr->left);
cout<<ptr->data<<" ";
Inorder(ptr->right);
}
}

void Post_order(Node *ptr)
{
if(ptr==NULL)
{
return;
}
else
{
Post_order(ptr->left);
Post_order(ptr->right);
cout<<ptr->data<<" ";
}
}

int main()
{
int size;

cout<<"\n Enter the size of the array : ";
cin>>size;
int arr[size];
cout<<"\n Enter the elements in the array : ";
for (int i = 0; i < size; i++)
cin>>arr[i];
MakeNode(arr,size);

cout<<"\n Preorder : ";
preorder(root);
cout<<"\n Inorder : ";
Inorder(root);
cout<<"\n Post Order : ";
Post_order(root);
cout<<"\n";
return 0;
}

//Binary Search Tree Program
#include <iostream>
using namespace std;

//Node
struct Node
{
int data;
Node* left, *right;
}*root = NULL;

// Finding position for the current node and Inserting it
void Insert_In_Tree(Node* ptr, Node* newnode)
{

if (root == NULL)
{
root = newnode;
}

else
{
if (newnode->data <= ptr->data)
{
if (ptr->left == NULL)
{
ptr->left = newnode;
}

else
{
Insert_In_Tree(ptr->left, newnode);
}
}

else
{
if(ptr->right == NULL)
{
ptr->right = newnode;

}

else
{
Insert_In_Tree(ptr->right, newnode);
}
}
}

return;
}


int main()
{
int size;

cout<<"\n Enter the size of the array : ";
cin>>size;
int arr[size];
cout<<"\n Enter the elements in the array : ";
for (int i = 0; i < size; i++)
cin>>arr[i];
MakeNode(arr,size);

return 0;
}

For  Program with Output Just insert the Below Functions Click here

//MERGE SORT PROGRAM IN C++

#include<iostream>
using namespace std;

void merge(int arr[], int start, int size, int mid)
{
int s1, s2, i, j;

//Assigning size to the two array to be merged.
s1 = mid - start + 1;
s2 = size - mid;

int arr1[s1], arr2[s2];

//Initailizing those array
for (i = 0; i < s1; i++)
arr1[i] = arr[start + i];
for (j = 0; j < s2; j++)
arr2[j] = arr[mid + 1 + j];
i = 0;
j = 0;

int k = start;

//Merging them in sorted array
while (i < s1 && j < s2)
{
if (arr1[i] <= arr2[j])
{
arr[k] = arr1[i];
i++;
}
else
{
arr[k] = arr2[j];
j++;
}
k++;
}

while (i < s1)
{
arr[k] = arr1[i];
i++;
k++;
}

while (j < s2)
{
arr[k] = arr2[j];
j++;
k++;
}
}

void mergesort(int arr[],int start, int size)
{
int mid;

if (size - start + 1 < 2)
{
return;
}

else
{
mid = (start + size)/2;
//Sorting left array
mergesort(arr, start, mid);
//Sorting right array
mergesort(arr, mid + 1,size);
merge(arr, start, size, mid);
}
}

int main()
{
int arr[10], size;
cout<<"\n Enter the size of array : ";
cin>>size;
cout<<"\n Enter the element in the array : ";
for (int i = 0; i < size; i++)
cin>>arr[i];

mergesort(arr, 0, size-1);
cout<<"\n Sorted Array is : ";
for (int i = 0; i < size; i++)
cout<<arr[i]<<" ";
return 0;
}

//Program to Add two Binary Numbers in C++ by if else
#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
int main()
{
char a[20],b[20],c[21];
int i,j,x,y,l=0,z;
cout<<"\n Enter first Binary number : ";
cin>>a;                                                                             //use gets(a);
cout<<"\n Enter second binary number : ";
cin>>b; //Use gets(b);
for(i=0;a[i]!='\0';i++)
{
x=i;
}
for(j=0;b[j]!='\0';j++)
{
y=j;
}
    if(x!=y)
    {
    z=x-y;
    if(z>0)
{
for(i=y,j=x;i>=0,j>=(0+z);i--,j--)
{
b[j]=b[i];
}
y=x;
for(i=0;i<z;i++)
{
b[i]='0';
}
}
else
{
z=abs(z);
for(i=x,j=y;i>=0,j>=(0+z);i--,j--)
{
a[j]=a[i];
}
x=y;
for(i=0;i<z;i++)
{
a[i]='0';
}
}
}


for(i=x,j=y;i>=0,j>=0;i--,j--)
{
if(a[i]=='1'&&b[i]=='1'&&l==1)
{
c[i]='1';
l=1;
}
else
if(a[i]=='1'&&b[j]=='1'&&l==0)
{
c[i]='0';
l=1;
}
else
if(a[i]=='1'&&b[j]=='0'&&l==0)
{
c[i]='1';
l=0;
}
else
if(a[i]=='1'&&b[j]=='0'&&l==1)
{
c[i]='0';
l=1;
}
else
if(a[i]=='0'&&b[j]=='1'&&l==0)
{
c[i]='1';
l=0;
}
else
if(a[i]=='0'&&b[j]=='1'&&l==1)
{
c[i]='0';
l=1;
}
else
if(a[i]=='0'&&b[j]=='0'&&l==1)
{
c[i]='1';
l=0;
}
else
{
c[i]='0';
l=0;
}
}
if(l==1)
{
for(i=x+1;i>0;i--)
{
c[i]=c[i-1];
}
c[0]='1';
}
cout<<"\n Binary addition is : ";
for(i=0;i<=(x+1);i++)
cout<<c[i];
return 0;
}

//Program to Calculate Factorial of a number using Recursion in C++
#include<iostream>
using namespace std;
int fac(long long int fact,int n)
{
if(n==1)
return fact;
else
{
fact=fact*n;
n--;

return fac(fact,n);

}
}
int main()
{
int x;
long long int f;
cout<<"\n Enter a number : ";
cin>>x;
f=fac(1,x);
cout<<"\n Fact = "<<f;
return 0;
}

Features of Program:

• Add
• Display Record by Roll no Search.
• Modify Data
• Delete Data
• Show all Record.