Here you will get program for linear search in C++. In linear search algorithm, we compare targeted element with each element of the array. If the element is found then its position is displayed. The worst case time complexity for linear search is O(n). Program for Linear Search in C++ #include<iostream> using namespace std; int main() …
Actually this program doesn’t creates a facebook login screen. I have just used graphics to create two boxes with an option to enter username and password. This is program is to just give you an idea that how you can create a login screen for your project. #include<conio.h> #include<iostream.h> #include<graphics.h> #include<stdio.h> #include<dos.h> #include<process.h> void logo() …
* * * * * ***** code: #include<iostream.h>#include<conio.h> void main(){ clrscr(); int i,k,j,n; cout<<“Enter size of triangle in odd number(min-5,ex-5,7,9):”; cin>>n; cout<<“nt”; for(i=1;i<=n;i+=2) { for(j=n;j>i;j-=2) cout<<” “; for(k=1;k<=i;++k) { if(i==n) cout<<“*”; else if(k==1||k==i) cout<<“*”; else cout<<” “; } cout<<“nt”; } getch();}
* ** *** ****code: #include<iostream.h>#include<conio.h> void main(){ clrscr(); int i,n,j,k; cout<<“Enter size of triangle(ex-5):”; cin>>n; cout<<“nt”; for(i=0;i<n;++i) { for(j=n;j>i;–j) cout<<” “; for(k=0;k<+i;++k) cout<<“*”; cout<<“nt”; } getch();}
* ** *** **** ***** code:#include<iostream.h>#include<conio.h> void main(){ clrscr(); int n,i,j; cout<<“Ener size of Triangle(ex-4):”; cin>>n; cout<<“nt”; for(i=0;i<n;++i) { for(j=0;j<=i;++j) cout<<“*”; cout<<“nt”; } getch();}
#include<iostream.h> #include<conio.h> void main() { clrscr(); int n,i; long sum=0; cout<<“1^2+3^2+5^2+……+n^2nn Enter Value of n:”; cin>>n; for(i=1;i<=n;i+=2) sum+=(i*i); cout<<“n Sum of given series is “<<sum; getch(); }
Here you will learn about binary search in C++. Binary search is an algorithm used to search for an element in a sorted array. In this algorithm the targeted element is compared with middle element. If both elements are equal then position of middle element is returned and hence targeted element is found. If both …
#include<fstream.h> #include<conio.h> void main() { clrscr(); ifstream fin(“STORY.TXT”); char ch; int i,a=0,s=0,d=0; while(fin) { fin.get(ch); i=ch; if(i>63&&i<91||i>96&&i<123) a++; else if(ch==’ ‘) s++; else if(i>47&&i<58) d++; } cout<<“No. OF Alphabates:”<<a; cout<<“nNo. Of Digits:”<<d; cout<<“nNo. Of Spaces:”<<s; getch(); }
