TODO:DESCRIPTION
search_linear.cpp
:
#include <iostream>
#include <algorithm>
#include <vector>
template <typename T, class ForwardIterator>
ForwardIterator search_linear(
ForwardIterator begin,
ForwardIterator end,
T const & element)
{
while (begin != end) {
if (*begin == element)
return begin;
++begin;
}
return end;
}
int main(int, char **)
{
std::vector<int> v{ 60, 50, 10, 80, 0, 40, 90, 20, 70, 30, 10 };
std::sort(v.begin(), v.end());
auto i = search_linear(v.begin(), v.end(), 60);
if (i == v.end())
std::cout << "element not found" << std::endl;
else
std::cout << "element found " << *i << " at index "
<< i - v.begin() << std::endl;
return 0;
}
search_linear.scm
: