public static Find ( double>.Func |
||
function | double>.Func | The function to have its root computed. |
lowerBound | int | Start of search region. |
upperBound | int | End of search region. |
value | double | The value to be looked for in the function. |
리턴 | int |
public void ConstructorTest1() { Func<int, double> function = x => elements[x]; BinarySearch search = new BinarySearch(function, 0, elements.Length); int a1 = search.FindRoot(); Assert.AreEqual(1, a1); for (int i = 0; i < elements.Length; i++) { int a2 = search.Find(elements[i]); Assert.AreEqual(i, a2); } }
public void ConstructorTest2() { Func<int, double> function = x => elements[x]; BinarySearch search = new BinarySearch(function, 0, elements.Length - 1); int a1 = search.Find(5); int a2 = search.Find(6); int a3 = search.Find(elements.Max() + 1); int a4 = search.Find(elements.Max() - 1); int a5 = search.Find(elements.Max()); int a6 = search.Find(elements.Min() + 1); int a7 = search.Find(elements.Min() - 1); int a8 = search.Find(elements.Min()); Assert.AreEqual(a1, 4); Assert.AreEqual(a2, 5); Assert.AreEqual(a3, 8); Assert.AreEqual(a4, 8); Assert.AreEqual(a5, 8); Assert.AreEqual(a6, 1); Assert.AreEqual(a7, 0); Assert.AreEqual(a8, 0); }