Module: Linear and binary search for elements in an array


Problem

2/7

Linear search - 1

Theory Click to read/hide

Setpoint search algorithm
In order to find an element equal to the given value X, it is necessary to look through all the elements of the array from the first to the last. As soon as an element equal to the given value X is found, the search must be completed and display the result.

The easiest way to implement this algorithm is with the while loop operator. Try adding a condition yourself in the while operator.

Problem

In the given array, you need to find the value of the element equal to the value X. X is entered from the keyboard. Add a condition to the program so that it solves the problem. Numbering of elements starts with zero.

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
1 
#include<iostream>
2 
using namespace std;
3 
main()
4 
{
5 
  const int Nmax=1000;
6 
  int A[Nmax], i, M, N, X;
7 
  cin >> X >> N;
8 
  for (i=0; i<N; i++)
9 
    cin >> A[i];
10 
  i=0;
11
12 
     i = i + 1;
13 
  cout << "A[" << i << "]=" << X;
14 
}

     

Program check result

To check the solution of the problem, you need to register or log in!