DFS :: BUBBLE

#include<iostream.h> #include<conio.h> /* 5  1   2  4  3 5  5  1  1  1  1 1  1  5  2  2 […]

Share

DFS :: BINSEARCH

#include<iostream.h> #include<conio.h> search(int s,int e,int *a,int x) { int m; m=(s+e)/2; if(x==a[m]) { cout<<“Found.”; } else if(x<a[m]) { search(s,m-1,a,x); } […]

Share

Link-List

Link-List  Singly #include<stdio.h> #include<malloc.h> #include<process.h> void create(); void display(); void insert_front(); void insert_last(); void insert_after(); void del_front(); void del_last(); void […]

Share

Link-List

Link-List :: Doubly #include<stdio.h> #include<malloc.h> #include<process.h> void create(int); void display(); void insert_front(); void insert_last(); void insert_after(); void del_front(); void del_last(); […]

Share

Link-List

Link-List :: Circular #include<stdio.h> #include<malloc.h> #include<process.h> #include<conio.h> void create(int); void display(); void insert_front(); void insert_last(); void insert_after(); void del_front(); void […]

Share

Link List Program Data Structure :: Array :: Sparse

/* check whether matrix is sparce or not */ #include<iostream.h> void main() { int a[5][5],i,j,l=0,u=4,c1=0,c2=0; cout<<“enter matrix\n”; for(i=l;i<=u;i++) { for(j=l;j<=u;j++) […]

Share