-
Notifications
You must be signed in to change notification settings - Fork 1.6k
/
Copy pathBinarySearcherTests.cs
59 lines (49 loc) · 1.77 KB
/
BinarySearcherTests.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
using System.Linq;
using Algorithms.Search;
using NUnit.Framework;
using NUnit.Framework.Internal;
namespace Algorithms.Tests.Search;
public static class BinarySearcherTests
{
[Test]
public static void FindIndex_ItemPresent_IndexCorrect([Random(1, 1000, 100)] int n)
{
// Arrange
var searcher = new BinarySearcher<int>();
var random = Randomizer.CreateRandomizer();
var arrayToSearch = Enumerable.Range(0, n).Select(_ => random.Next(0, 1000)).OrderBy(x => x).ToArray();
var selectedIndex = random.Next(0, n);
// Act
var actualIndex = searcher.FindIndex(arrayToSearch, arrayToSearch[selectedIndex]);
// Assert
Assert.That(arrayToSearch[actualIndex], Is.EqualTo(arrayToSearch[selectedIndex]));
}
[Test]
public static void FindIndex_ItemMissing_MinusOneReturned(
[Random(0, 1000, 10)] int n,
[Random(-100, 1100, 10)] int missingItem)
{
// Arrange
var searcher = new BinarySearcher<int>();
var random = Randomizer.CreateRandomizer();
var arrayToSearch = Enumerable.Range(0, n)
.Select(_ => random.Next(0, 1000))
.Where(x => x != missingItem)
.OrderBy(x => x).ToArray();
// Act
var actualIndex = searcher.FindIndex(arrayToSearch, missingItem);
// Assert
Assert.That(actualIndex, Is.EqualTo(-1));
}
[Test]
public static void FindIndex_ArrayEmpty_MinusOneReturned([Random(100)] int itemToSearch)
{
// Arrange
var searcher = new BinarySearcher<int>();
var arrayToSearch = new int[0];
// Act
var actualIndex = searcher.FindIndex(arrayToSearch, itemToSearch);
// Assert
Assert.That(actualIndex, Is.EqualTo(-1));
}
}