Skip to content

Instantly share code, notes, and snippets.

View zainulhasan's full-sized avatar
🏠
Working from home

Syed Zain Ul Hasan zainulhasan

🏠
Working from home
  • Bangkok, Thailand
View GitHub Profile
/******************************
bubbleSort.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
int bubble_sort(int arr[],int n){
for(int i=0;i<n;i++)
for(int j=0;j<n-1;j++)
/******************************
binarySearch.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
int binary_search(int arr[],int n,int item){
/******************************
stack.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
const int size=20;
/******************************
trees.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
#include<stdlib.h>
using namespace std;
/******************************
insertionSort.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
/******************************
MergeSort.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
/******************************
Queue.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
const int MAX=6;
/******************************
dQueue.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
struct Node
/******************************
Dstack.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
/******************************
PriorityQueue.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
#include <stdlib.h>
using namespace std;