-
-
Notifications
You must be signed in to change notification settings - Fork 30.6k
/
Copy pathbinarySearch.test.js
34 lines (30 loc) · 1.33 KB
/
binarySearch.test.js
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
import binarySearch from '../binarySearch';
describe('binarySearch', () => {
it('should search number in sorted array', () => {
expect(binarySearch([], 1)).toBe(-1);
expect(binarySearch([1], 1)).toBe(0);
expect(binarySearch([1, 2], 1)).toBe(0);
expect(binarySearch([1, 2], 2)).toBe(1);
expect(binarySearch([1, 5, 10, 12], 1)).toBe(0);
expect(binarySearch([1, 5, 10, 12, 14, 17, 22, 100], 17)).toBe(5);
expect(binarySearch([1, 5, 10, 12, 14, 17, 22, 100], 1)).toBe(0);
expect(binarySearch([1, 5, 10, 12, 14, 17, 22, 100], 100)).toBe(7);
expect(binarySearch([1, 5, 10, 12, 14, 17, 22, 100], 0)).toBe(-1);
});
it('should search object in sorted array', () => {
const sortedArrayOfObjects = [
{ key: 1, value: 'value1' },
{ key: 2, value: 'value2' },
{ key: 3, value: 'value3' },
];
const comparator = (a, b) => {
if (a.key === b.key) return 0;
return a.key < b.key ? -1 : 1;
};
expect(binarySearch([], { key: 1 }, comparator)).toBe(-1);
expect(binarySearch(sortedArrayOfObjects, { key: 4 }, comparator)).toBe(-1);
expect(binarySearch(sortedArrayOfObjects, { key: 1 }, comparator)).toBe(0);
expect(binarySearch(sortedArrayOfObjects, { key: 2 }, comparator)).toBe(1);
expect(binarySearch(sortedArrayOfObjects, { key: 3 }, comparator)).toBe(2);
});
});