static void Main(string[] args)
{
List <string> testList = new List <string>()
{
"hello", "world", "test", "123", " "
};
Console.WriteLine(LinearSearch.Search(testList, "bla"));
List <int> testList2 = new List <int>()
{
0, 2, 3, 5, 6, 8, 9, 15, 20, 21
};
Console.WriteLine(BinarySearch.Search(testList2, 20));
Console.WriteLine(BinarySearch.Search(testList2, 22));
Console.WriteLine(BinarySearch.Search(testList2, 4));
Console.ReadLine();
}
//Search runtime O(n log n)
public static bool CheckBinarySearch(int[] A, int k)
{
bool result = false;
for (int i = 0; i < A.Length; i++)
{
if (k < A[i])
{
result = BinarySearch.Search(A, A[i] - k, i + 1, A.Length - 1);
}
else
{
result = BinarySearch.Search(A, k - A[i], i + 1, A.Length - 1);
}
if (result)
{
break;
}
}
return(result);
}
