forked from knaxus/problem-solving-javascript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBinarySearch.test.js
41 lines (38 loc) · 1.35 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
35
36
37
38
39
40
41
const { binarySearch, binarySearchRecursive } = require('.');
describe('Binary Search', () => {
const array = [1, 2, 3, 4, 5, 6, 7, 8];
const low = 0;
const high = array.length - 1;
describe('When element to find is at 1st position ', () => {
it('Binary search with Loop', () => {
expect(binarySearch(array, 1)).toEqual(0);
});
it('Binary serach with recursion', () => {
expect(binarySearchRecursive(array, low, high, 1)).toEqual(0);
});
});
describe('When element to find is at last position ', () => {
it('Binary search with Loop', () => {
expect(binarySearch(array, 7)).toEqual(6);
});
it('Binary serach with recursion', () => {
expect(binarySearchRecursive(array, low, high, 7)).toEqual(6);
});
});
describe('When element to find is at random position ', () => {
it('Binary search with Loop', () => {
expect(binarySearch(array, 3)).toEqual(2);
});
it('Binary serach with recursion', () => {
expect(binarySearchRecursive(array, low, high, 3)).toEqual(2);
});
});
describe('When element to find is no present in array ', () => {
it('Binary search with Loop', () => {
expect(binarySearch(array, 10)).toEqual(null);
});
it('Binary serach with recursion', () => {
expect(binarySearchRecursive(array, low, high, 10)).toEqual(null);
});
});
});