mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 00:01:37 +08:00
833d05d8d0
* required, optional param left-to-right approch in BS * base case return early to avoid nested if block * codes formated with standard.js
33 lines
960 B
JavaScript
33 lines
960 B
JavaScript
import { binarySearch } from '../BinarySearch'
|
|
|
|
describe('BinarySearch', () => {
|
|
const arr = [2, 3, 4, 10, 25, 40, 45, 60, 100, 501, 700, 755, 800, 999]
|
|
const low = 0
|
|
const high = arr.length - 1
|
|
|
|
it('should return index 3 for searchValue 10', () => {
|
|
const searchValue = 10
|
|
expect(binarySearch(arr, searchValue, low, high)).toBe(3)
|
|
})
|
|
|
|
it('should return index 0 for searchValue 2', () => {
|
|
const searchValue = 2
|
|
expect(binarySearch(arr, searchValue, low, high)).toBe(0)
|
|
})
|
|
|
|
it('should return index 13 for searchValue 999', () => {
|
|
const searchValue = 999
|
|
expect(binarySearch(arr, searchValue, low, high)).toBe(13)
|
|
})
|
|
|
|
it('should return -1 for searchValue 1', () => {
|
|
const searchValue = 1
|
|
expect(binarySearch(arr, searchValue, low, high)).toBe(-1)
|
|
})
|
|
|
|
it('should return -1 for searchValue 1000', () => {
|
|
const searchValue = 1000
|
|
expect(binarySearch(arr, searchValue, low, high)).toBe(-1)
|
|
})
|
|
})
|