Skip to content

Add test cases, optamization of code, and Add description of function #848

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Nov 26, 2021
Merged

Add test cases, optamization of code, and Add description of function #848

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8f855cd
Add test cases, optamization of code, and Add description of function
Yatin-kathuria Nov 26, 2021
4f3dcb5
update testcase
Yatin-kathuria Nov 26, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
43 changes: 30 additions & 13 deletions Recursive/BinarySearch.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,19 +1,36 @@

// https://en.wikipedia.org/wiki/Binary_search_algorithm
// Search the integer inside the sorted integers array using Binary Search Algorithm
/**
* @function BinarySearch
* @description Search the integer inside the sorted integers array using Binary Search Algorithm.
* @param {Integer[]} arr - sorted array of integers
* @param {Integer} low - The input integer
* @param {Integer} high - The input integer
* @param {Integer} searchValue - The input integer
* @return {Integer} - return index of searchValue if found else return -1.
* @see [BinarySearch](https://en.wikipedia.org/wiki/Binary_search_algorithm)
*/

export const BinarySearch = (intArr, searchQuery) => {
if (searchQuery === null || searchQuery === undefined || intArr.length === 0) {
return false
}
const binarySearch = (arr, low = 0, high = arr.length - 1, searchValue) => {
if (high >= low) {
const mid = low + Math.floor((high - low) / 2)

// If the element is present at the middle
if (arr[mid] === searchValue) {
return mid
}

const middleIndex = intArr.length === 1 ? 0 : Math.ceil(intArr.length / 2)
// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > searchValue) {
return binarySearch(arr, low, mid - 1, searchValue)
}

if (intArr[middleIndex] === searchQuery) {
return true
} else if (intArr.length > 1) {
return intArr[middleIndex] < searchQuery ? BinarySearch(intArr.slice(1, middleIndex)) : BinarySearch(intArr.slice(middleIndex))
} else {
return false
// Else the element can only be present in right subarray
return binarySearch(arr, mid + 1, high, searchValue)
}

// We reach here when element is not present in array
return -1
}

export { binarySearch }
32 changes: 32 additions & 0 deletions Recursive/test/BinarySearch.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
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, low, high, searchValue)).toBe(3)
})

it('should return index 0 for searchValue 2', () => {
const searchValue = 2
expect(binarySearch(arr, low, high, searchValue)).toBe(0)
})

it('should return index 13 for searchValue 999', () => {
const searchValue = 999
expect(binarySearch(arr, low, high, searchValue)).toBe(13)
})

it('should return -1 for searchValue 1', () => {
const searchValue = 1
expect(binarySearch(arr, low, high, searchValue)).toBe(-1)
})

it('should return -1 for searchValue 1000', () => {
const searchValue = 1000
expect(binarySearch(arr, low, high, searchValue)).toBe(-1)
})
})