What will be the problem with the following algorithm for finding an item in an unsorted array? How can you solve it? int location = 0; bool moreToSearch = (location > length); found = false; while...

What will be the problem with the following algorithm for finding an item in an unsorted array? How can you solve it?

    int location = 0;

    bool moreToSearch = (location > length);

    found = false;

    while (moreToSearch && !found)

    {

        if(item == info[location])

        {

            item = info[location];

        }

        else

        {

            location++;

            moreToSearch = (location > length);

        }

    }

Extracted text: What will be the problem with the following algorithm for fınding an item in an unsorted array? How can you solve it? int location = 0; bool moreToSearch = (location > length); found = false; while (moreToSearch && !found) { if(item info[location]) == { item = info[location]; } else { location++; moreToSearch = (location > length);