Линейный поиск с 2 указателями

int find(int* array, int* afterLast, int value)
{
    int* afterLast = array + sizeof(array) / sizeof(array[0]);
    for (int*first = array; first != afterLast; ++first)
    {
        if (array[first] == value)
            return first;
    }
    return -1;
}

printf("find: %d\n", find(array, first - array, 8));
    printf("find: %d\n", find(array, (first - array) - 1, 8));

        if ( *first == value)
            return *first;

int* afterLast = array + sizeof(array) / sizeof(array[0]);

sizeof(int*) / sizeof(int)

int find(int* array, int* afterLast, int value)
{
    int* afterLast = array + sizeof(array) / sizeof(array[0]);
    for (int index = 0; index != afterLast; ++index)
    {
        if (array[index] == value)
            return index;
    }
    return -1;
}

//Title of this code
//g++  4.9.2
 
#include <iostream>
 
 
 
int * find(int * begin, int * end, int value)
{
   while ( begin != end && *begin != value )
      ++begin ;
   return begin ;
}
 
 
 
int main()
{
    int arr[] = { 10 , 32 , 11 , 26 } ;
    int * arrEnd = arr + sizeof(arr)/sizeof(*arr) ;
    int * pFind1 = find ( arr , arrEnd , 11 ) ;
    int * pFind2 = find ( arr , arrEnd , 31 ) ;
    if ( pFind1 == arrEnd )
    {
        std::cout << "not found" << std::endl ;
    }
    else
    {
        std::cout << *pFind1 << std::endl ;
    }
    
    if ( pFind2 == arrEnd )
    {
        std::cout << "not found" << std::endl ;
    }
    else
    {
        std::cout << *pFind2 << std::endl ;
    }
}

#include <iostream>
#include <limits>
 
const size_t invalid_index = std::numeric_limits<size_t>::max() ;
 
 
int * find( int * begin, int * end, int value)
{
   while ( begin != end && *begin != value )
      ++begin ;
   return begin ;
}
 
 
 
size_t find_index ( int * arr , size_t count , int value )
{
    int * arrEnd = arr + count ;
    int * pFind = find ( arr , arrEnd , value ) ;
    if ( pFind != arrEnd )
        return static_cast<size_t>(pFind - arr) ;
    return invalid_index ;
}
 
 
 
int main()
{
    int arr[] = { 10 , 32 , 11 , 26 } ;
    size_t count = sizeof(arr)/sizeof(*arr) ;
    std::cout << find_index ( arr , count , 11 ) << std::endl ;
    std::cout << find_index ( arr , count , 31 ) << std::endl ;
}

#include <iostream>
#include <limits>
 
const size_t invalid_index = std::numeric_limits<size_t>::max() ;
 
 
 
size_t find_index ( int * arr , size_t count , int value )
{
    for ( size_t i = 0 ; i < count ; ++i )
    {
        if ( arr[i] == value )
            return i ;
    }
    return invalid_index ;
}
 
 
 
int main()
{
    int arr[] = { 10 , 32 , 11 , 26 } ;
    size_t count = sizeof(arr)/sizeof(*arr) ;
    std::cout << find_index ( arr , count , 11 ) << std::endl ;
    std::cout << find_index ( arr , count , 31 ) << std::endl ;
}

int main()
{
int array[5];
array[0] = 2;
array[1] = 5;
array[2] = 2;
array[3] = 3;
array[4] = 8;
printf("find: %d\n", find(array, (first - array) - 1, 8));
}

int find(int* first, int* last, int value)
{
   int index = 0;
   while (first+index!=last)
   {
       if (first[index]==value)
           return index;
       index++;
   }
   return -1;
}
//...
    int arr[] = { 10 , 32 , 11 , 26 } ;
    int* last = arr + sizeof(arr)/sizeof(arr[0]) ;
    int Find1 = find ( arr , last , 26 ) ;