Input #include<bits/stdc++.h> using namespace std; template<class T> class Linear { public: int n; T a; T *arr; Linear(int x) { n=...
Input #include<iostream> using namespace std; template <class X_Type> class SortingOfArray { public: X_Type *arr; int size; X_Type...
Input #include<iostream> using namespace std; template<class t> class node { public: t data; node<t> *next; }; template<class...
Input #include<iostream> using namespace std; template<class t> class node { public: t data; node *prev,*next; }; template<class...
Input #include<iostream> using namespace std; template<class t> class node { public: t data; node *next; }; template<class t>...
Input #include <iostream> using namespace std; template <typename T> class Node { public: T info; Node<T>* next; Node() { next=0;...
Input #include<iostream> using namespace std; template <class X_Type> class LinkedList_using_Array { X_Type arr[100]; int n ,...
Input #include<iostream> using namespace std; const int size=5; int flag=0; template<class t> class CQ { static const int...
Input #include <iostream> using namespace std; template <class T> class node { public: T info; node *next; node(T a,node *p=0)...
Input #include<iostream> using namespace std; class node { public: int power; int coeff; node *next; }; class poly { node *first; int...
Input #include<iostream> using namespace std; int i = 1; int factorial(int n); void factor(int n, int i); int iter_factorial(int n);...
Input #include <iostream> using namespace std; int Fibonacci(const int& n) { if (n <= 1) return 0; else if (n == 2 || n == 3)...
Input (with recursion) #include<iostream> #include <stdio.h> using namespace std; int GCD(int a, int b); int main() { cout <<...
Input #include<iostream> using namespace std; #define MAX 20 class bstnode { public: int info; bstnode *left, *right; bstnode() {...
Input #include<iostream> using namespace std; void StoN() { int val, arrM[20][20], S[20][3], r=0, c=0, j; cout<<"\n Enter the...