|
| 1 | +const { binarySearch, binarySearchRecursive } = require('.'); |
| 2 | + |
| 3 | +describe('Binary Search', () => { |
| 4 | + const array = [1, 2, 3, 4, 5, 6, 7, 8]; |
| 5 | + const low = 0; |
| 6 | + const high = array.length - 1; |
| 7 | + |
| 8 | + describe('When element to find is at 1st position ', () => { |
| 9 | + it('Binary search with Loop', () => { |
| 10 | + expect(binarySearch(array, 1)).toEqual(0); |
| 11 | + }); |
| 12 | + it('Binary serach with recursion', () => { |
| 13 | + expect(binarySearchRecursive(array, low, high, 1)).toEqual(0); |
| 14 | + }); |
| 15 | + }); |
| 16 | + describe('When element to find is at last position ', () => { |
| 17 | + it('Binary search with Loop', () => { |
| 18 | + expect(binarySearch(array, 7)).toEqual(6); |
| 19 | + }); |
| 20 | + it('Binary serach with recursion', () => { |
| 21 | + expect(binarySearchRecursive(array, low, high, 7)).toEqual(6); |
| 22 | + }); |
| 23 | + }); |
| 24 | + describe('When element to find is at random position ', () => { |
| 25 | + it('Binary search with Loop', () => { |
| 26 | + expect(binarySearch(array, 3)).toEqual(2); |
| 27 | + }); |
| 28 | + it('Binary serach with recursion', () => { |
| 29 | + expect(binarySearchRecursive(array, low, high, 3)).toEqual(2); |
| 30 | + }); |
| 31 | + }); |
| 32 | + describe('When element to find is no present in array ', () => { |
| 33 | + it('Binary search with Loop', () => { |
| 34 | + expect(binarySearch(array, 10)).toEqual(null); |
| 35 | + }); |
| 36 | + it('Binary serach with recursion', () => { |
| 37 | + expect(binarySearchRecursive(array, low, high, 10)).toEqual(null); |
| 38 | + }); |
| 39 | + }); |
| 40 | + |
| 41 | +}); |
0 commit comments