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
7 followers · 11 following
  • Islamabad,Pakistan
  • 11:29 (UTC +05:00)
View GitHub Profile
@zainulhasan
zainulhasan / dQueue.cpp
Created August 3, 2015 05:30
/******************************
dQueue.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
struct Node
@zainulhasan
zainulhasan / Queue.cpp
Created August 3, 2015 05:29
/******************************
Queue.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
const int MAX=6;
@zainulhasan
zainulhasan / MergeSort.cpp
Created August 3, 2015 05:29
/******************************
MergeSort.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
@zainulhasan
zainulhasan / insertionSort.cpp
Created August 3, 2015 05:28
/******************************
insertionSort.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
@zainulhasan
zainulhasan / trees.cpp
Created August 3, 2015 05:21
/******************************
trees.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
#include<stdlib.h>
using namespace std;
@zainulhasan
zainulhasan / stack.cpp
Last active August 29, 2015 14:26
/******************************
stack.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
const int size=20;
@zainulhasan
zainulhasan / binarySearch.cpp
Created August 3, 2015 05:19
/******************************
binarySearch.cpp
Auther:Syed Zain Ul hasan
*****************************/
#include <iostream>
using namespace std;
int binary_search(int arr[],int n,int item){
@zainulhasan
zainulhasan / bubbleSort.cpp
Last active August 29, 2015 14:26
/******************************
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++)
@zainulhasan
zainulhasan / pq.cpp
Last active July 31, 2022 15:05
Priority Queue using Doubly Linked List
/**
* Priority Queue using Doubly Linked List
* Auther : Syed Zain Ul Hasan
* 01-134132-185
* BS(CS) 4A
* Bahria University Islamabad.
* [email protected].
*
**/