0-1 Knapsack In C++
#include<iostream> using namespace std; int weight[]={10, 20, 30}; int price []={60, 100, 120}; int capasity=50; int i,n=...
Showing posts with label Programming. Show all posts
Showing posts with label Programming. Show all posts
Fibonacci in c++ with Recursion
//Fibonacci number with Recursion #include<iostream> using namespace std; int fibonacci(int n) { if(n==0 ||n==1 )/...
Counting Sort
Counting Sort //Counting Sort in C++............... #include<iostream> using namespace std; int main() { int a[] ...
Merge Sort in C..
//Merge Sort in C.............................. #include<stdio.h> #include<stdlib.h> void merge(int *L,int *R,int *...
Quick Sort
//Quick Sort in c................ #include<iostream> using namespace std; int partition(int *A,int start,int end) { in...
All parts of Sorting .....
//Bubble Sorting in C++.. #include<iostream> using namespace std; int ...
ALL Parts of String
//Insert and print Charter,string,string sentence... #include <stdio.h> int main() { char ch,s[50],sen[500]; printf(...
Singly Linked List in (C++)
#include<iostream> using namespace std; struct Node { int data; Node *next; Node *prev; }; Node *Head=NULL; ...
Doubly Linked List
#include<iostream> using namespace std; struct Node { int data; Node *next; Node *prev; }; Node *Head=NULL; ...
BST tree in C++
#include<iostream> using namespace std; struct Node { int data; Node *left; Node *right; }; Node *root,*nptr,*tptr...
Stack in C
#include<stdio.h> #define MAX 4 int mystack[MAX], top=-1; void push(int value) { if(top>=MAX-1) { printf(...
Subscribe to:
Posts
(
Atom
)
