RAVI PATEL rv5047

## min_maxHeap.cpp
#include<iostream>
#include<cmath>
#include<climits>
using namespace std;

// Prototype of a utility function to swap two integers
void swap(int *x, int *y);

// A class for Min-Max Heap
class MinMaxHeap

## brute_force_atk.cpp
/* This is progam of ceasar cipher encryption and brute force attack */

#include<iostream>
using namespace std;

//function to encrypt the plain text
string encrypt(string x,int n)
    {
    string cipher="";


## ceasar_cipher.cpp
#include<iostream>
using namespace std;

//function to encrypt the plain text
string encrypt(string x,int n)
    {
    string cipher="";

    for(int i=0;i<x.length();i++)
        {

## doubly_linked_list.cpp
#include<iostream>
#include<stdlib.h>
using namespace std;

struct node
    {
    int info;
    struct node *next;
    struct node *prev;
    }*head=NULL,*tail=NULL;

## linked_list.cpp
#include<iostream>
#include<stdlib.h>
using namespace std;

struct node
    {
    int info;
    struct node *link;
    }*head=NULL;
	#include<iostream>
	#include<cmath>
	#include<climits>
	using namespace std;

	// Prototype of a utility function to swap two integers
	void swap(int x, int y);

	// A class for Min-Max Heap
	class MinMaxHeap
	/* This is progam of ceasar cipher encryption and brute force attack */

	#include<iostream>
	using namespace std;

	//function to encrypt the plain text
	string encrypt(string x,int n)
	{
	string cipher="";
	#include<iostream>
	#include<stdlib.h>
	using namespace std;

	struct node
	{
	int info;
	struct node *next;
	struct node *prev;
	}head=NULL,tail=NULL;