public void BinarySearchWithoutRecursion()
{
int[] nums = { -1, 0, 3, 5, 9, 12 };
int pos = BinarySearchProblem.FindPosition(nums, 2);
}
public void Intersection()
{
int[] nums1 = { 4, 9, 5 };
int[] nums2 = { 9, 4, 9, 8, 4 };
var result = BinarySearchProblem.Intersection(nums1, nums2);
}
public void BinarySearch()
{
int[] nums = { 100, 200, 300, 400, 500, 600, 700, 800, 900 };
int pos = BinarySearchProblem.FindPosition(nums, 0, 8, 400);
}
