Search methods

Linear and binary search

Card 1

The beginning

Linear and binary search are two methods used to find an element in a list. The `linear` search checks each element one by one, while the `binary` search splits the sorted list to quickly find the desired value.

Try for `vector =`

and `deCăutat =`

THE VECTOR MUST BE SORTED!

Linear search

#include <iostream>
using namespace std;

int vector[1001];

int main()
{
    int nrElemente;
    cin>>nrElemente;

    for(int i=0;i<nrElemente;i++)
    {
        cin>>vector[i];
    }

    int deCautat;
    cin>>deCautat;
    int status = 0;//0-NO  1-YES

    for(int i=0;(i<nrElemente) && (status==0);i++)
    {
        if(vector[i]==deCautat)
        {
            cout<<"--->I found the value "<<deCautat<<"at "<<i<<" index.";
            status=1;
        }
    }

    if(status==0)
    {
        cout<<"--->The value "<<deCautat<<" was not found in the vector.";
    }

    return 0;

}

This card shows linear search in the C++ language.

Animation

The linear search animation appears in this card.

Binary search

#include <iostream>
using namespace std;

int vector[1001];


int main() 
{
    int nrElemente;
    cin>>nrElemente;
    for(int i=0;i<nrElemente;i++)
    {
        cin>>vector[i];
    }

    int deCautat;
    cin >> deCautat;
    int l = 0, r = 8, ok = 0;

    while ((l <= r) && (ok == 0)) 
    {
        int m = (l + r) / 2;
        if (deCautat > vector[m]) 
        {
            l = m + 1;
        } 
        else if (deCautat < vector[m]) 
        {
            r = m - 1;
        } else 
        {
            cout<<"--->I found the value "<<deCautat<<"at "<<i<<" index.";
            ok = 1;
        }
    }

    if (ok == 0) 
    {
        cout<<"--->The value "<<deCautat<<" was not found in the vector.";
    }

    return 0;
}

This card shows binary search in the C++ language.

Animation

This card shows the animation of binary search, using a sorted vector for visual demonstration.

Search methods

Linear and binary search

Card 1

The beginning

Linear and binary search are two methods used to find an element in a list. The linear search checks each element one by one, while the binary search splits the sorted list to quickly find the desired value.

Try for vector =

and deCăutat =

THE VECTOR MUST BE SORTED!

Linear search

Animation

Binary search

Animation

Linear and binary search are two methods used to find an element in a list. The `linear` search checks each element one by one, while the `binary` search splits the sorted list to quickly find the desired value.

Try for `vector =`

and `deCăutat =`