Array : Search

/* THE BASIC SEARCH ALGORITHM FOR A 1-D ARRAY */
#include <stdio.h> int search (int arraytosearch[], int valuetosearch, int size) { int i, found; /* initialize found at -1, if value not found, stays at -1 */ found = -1; /* search until found or until end of array */ i = 0; while (found<0 && i<size) { if (arraytosearch[i] == valuetosearch) found = i; /* I have found it! */ else i = i + 1; } return (found); } int main (void) { int x[] = {12,67,56,60,88,34,123}; int value = 60; int pos, i; pos = search (x, value, 7); if (pos >= 0) printf ("%d was found at position %d.\n", value, pos); else printf ("%d was not found in the array.\n", value); return (0); }
Legend: preprocessor directives | variable declarations | main program | helper functions | user-defined structures | comments
60 was found at position 3.

৩টি মন্তব্য:

  1. Zubair Hossain
    ID: 201610287, Ashulia campus


    #include
    using namespace std;
    int main()
    {
    int array[100], search, i, n;
    cout<<"Enter the number of elements in array"<>n;
    cout<<"Enter "<< n <<"numbers"<>array[i];
    cout<<"Enter the number to search"<>search;

    for (i = 0; i < n; i++)
    {
    if (array[i] == search)
    {
    cout<<search <<"present at location" << i+1<<endl;
    break;
    }
    }
    if (i == n)
    cout<<search <<"is not present in array"<<endl;
    }


    উত্তরমুছুন
  2. #include
    int main(){
    int a[5],i;
    for(i=0;i<=4;i++)
    {
    scanf("%d",&a[i]);
    }
    printf("array element are");
    for(i=0;i<=4;i++)
    {
    printf("%d\n",a[i]);
    }
    }

    উত্তরমুছুন
  3. #include
    int main(){
    int a[5],i;
    for(i=0;i<=4;i++)
    {
    scanf("%d",&a[i]);
    }
    printf("array element are");
    for(i=0;i<=4;i++)
    {
    printf("%d\n",a[i]);
    }
    }

    উত্তরমুছুন