#ifndef CA_UWATERLOO_ALUMNI_DWHARDER_SEARCHING_ALGORITHMS_LINEAR_SEARCH_ARRAY
#define CA_UWATERLOO_ALUMNI_DWHARDER_SEARCHING_ALGORITHMS_LINEAR_SEARCH_ARRAY

namespace Searching_algorithms {
	namespace Linear_search {
		class Array {
			public:
				template <typename Type>
				static
				bool search( Type const &obj, Type *const array, int const n ) {
					return search( obj, array, 0, n - 1 );
				}


				template <typename Type>
				static
				bool search( Type const &obj, Type *array, int a, int b ) {
					if ( a > b ) {
						return false;
					}

					int i = a;

					for ( ; i < b && array[i] < obj; ++i ) {
						// do nothing
					}

					return ( array[i] == obj );
				}
		};
	}
}

#endif