First N Prime Numbers
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
Showing posts with label CPP. Show all posts
Showing posts with label CPP. Show all posts
Prime Numbers Upto N
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
Binary Search in C++
//Binary Search in 1D Array #include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace...
Filling of Randomly Generated Unique Values in 1D Array in C++.
//Generate Unique Random Values and Store in Array. #include<iostream> #include<iomanip> #include<time.h> #include<st...
Reverse the values of an 1D array in C++
#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...
Find and Replace a value in an Array (Linear Search)
#include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace std; void searchArray() { ...
Search an element in an Array using Linear Search concept in C++ (WITH EXPLANATION VIDEO)
#include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace std; void searchArray() { ...
Various Patterns in C++ using Nested Loops
#include<iostream> #include<iomanip> using namespace std; void Pattern1(int n) { int i, j, k, x=1; for(i=1;i<=n;i++) {...
SHIFT ALL 0s TO FRONT & 2s AT LAST OF ARRAY WITHOUT USING SORT LOGIC IN C++
#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]==...
Cyclic Rotate 1D Array using C++
#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...
Subscribe to:
Posts
(
Atom
)
