First N Prime Numbers
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
//Binary Search in 1D Array #include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace...
//Generate Unique Random Values and Store in Array. #include<iostream> #include<iomanip> #include<time.h> #include<st...
#include<iostream> #include<iomanip> using namespace std; int main() { int ar[11]={19,14,23,22,18,25,17,30,9,17,33}, n=1...
#include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace std; void searchArray() { ...
#include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace std; void searchArray() { ...
#include<iostream> #include<iomanip> using namespace std; void Pattern1(int n) { int i, j, k, x=1; for(i=1;i<=n;i++) {...
#include<iostream> using namespace std; void shiftNumbers(int a[],int n) { int i,j,k,tmp; for(i=0,j=0;i<n;i++) { if(a[i]==...
#include<iostream> using namespace std; void cyclicRotate(int a[],int n) { int tmp,j; tmp=a[n-1]; for(j=n-1;j>0;j--) { a...
#include<iostream> using namespace std; void swap(int a[][4] ,int r, int c) { int i,j,n=4; for(int i=0;i<r;i++) { for(in...
//Entered number is automorphic number or not? #include<iostream> #include<math.h> using namespace std; int automorphic(int n)...
#include<iostream.h> #include<conio.h> #include<stdlib.h> #include<iomanip.h> class Queue { int data[10]; ...
/*Specially for the students of Class-12 of CBSE. It is a complete working code with proper presentation and password security system. J...
Download the File. Click here to Watch the Explanation & Developing Video