Skip to main content

C++ = Code to find number in an arrray.

Consider the following integer array of size 10, int array[10]={1,2,3,5,8,10,12,23,28,15} Write a c++ program that takes an integer value from the user at runtime and finds that value in the given array. If the value is found display message "Number is found" else display message "number does not found". 

 Code:

#include <iostream>

using namespace std;

int main()

{

    for (int i=1;i<=2;i++)

    {

int array[10]={1,2,3,5,8,10,12,23,28,15};

    int num;

    cout<<"Enter any digit : ";

    cin>>num;

    bool found=false;

    

    for (int i=1;i<=10;i++)

    {

    if (array[i]==num)

    {

    found=true;

    break;

}

}

    

    if (found)

    {

    cout<<"Number found"<<endl;

}

    else 

    {

    cout<<"Number not found"<<endl;

}

    }

return 0;

}


Result:



Comments

Post a Comment

Popular posts from this blog

C++ = Code for Counter

Code: #include <iostream> #include <conio.h> using namespace std; int main() {     int count = 0;     char input;     cout << "--------------------------" << endl;     cout << "          Counter         " << endl;     cout << "--------------------------" << endl;     cout << endl;     cout << "Press 1 to counter" << endl;     cout << "Press 0 to quit" << endl;     cout << endl;     cout << "Enter the number continuously : ";     while (true)     {         input = getch();         if (input == '1')         {             count += 1;             cout << "Your counts are " << count << endl;   ...
Post a Comment
Read more

C++ = Code to check number is a prime or not. If not find the nearest prime number.

Code:  #include <iostream> using namespace std; bool prime(int n) { if (n<=1) { return false; }        for (int i=2;i<=n/2;i++)    {       if (n%i==0)   {   return false;   }    }         return true; } int nearest(int n) { for (int i=n-1;i>=2;i--) { if (prime(i)) { return i; } } return 0; } int main () { int number; cout<<"Enter any number : "; cin>>number; if (prime(number)) { cout<<"The number is prime. "<<endl; }     else     {     cout<<"The entered number is compositive."<<endl;     cout<<"The nearest prime number will be "<<nearest(number)<<endl; } } Result:
Post a Comment
Read more

C++ = Code for checking any digit palindrome number

Code no: 1 = Using only main function to perform task. #include <iostream> using namespace std; int main() { int number,original,digit,reverse=0; cout<<"Enter any number : "; cin>>number; original=number; while (number!=0) { digit=number%10; reverse=(reverse*10)+digit; number=number/10; } if (original==reverse) { cout<<"This "<<original<<" is Palindrome number."; } else { cout<<"The "<<original<<" is not Palindrome number."; } } Result: Code no: 2 = Using two functions to perform same task. #include <iostream> using namespace std; int isprime(int num) { int digit=0,reverse=0; while (num!=0) { digit=num%10; reverse=(reverse*10)+digit;  num/=10; } return reverse; } int main() { int num; cout<<"Enter any digit to find its sum = "; cin>>num;          int original=num;          if (i...
Post a Comment
Read more