Commit 760a68f

committed

fixing recursive search, removing unnecessary if

1 parent 93f5bf3 commit 760a68fCopy full SHA for 760a68f

File tree

-4

lines changed

-4

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@ describe('Ternary Search', () => {`
`26`	`26`	`expect(ternarySearch(array, 3)).toEqual(2);`
`27`	`27`	`});`
`28`	`28`	`it('Ternary serach with recursion', () => {`
`29`		`- expect(ternarySearchRecursive(array, low, high, 3)).toEqual(2);`
	`29`	`+ expect(ternarySearchRecursive(array, low, high, 4)).toEqual(3);`
`30`	`30`	`});`
`31`	`31`	`});`
`32`	`32`	`describe('When element to find is no present in array ', () => {`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,15 +29,13 @@ function ternarySearch(arr, key){`
`29`	`29`	`}`
`30`	`30`
`31`	`31`	`function ternarySearchRecursive(arr, low, high, key){`
`32`		`- if(high > low){`
	`32`	`+ if(high >= low){`
`33`	`33`	`let highMiddle = low + 2 * Math.floor((high - low) / 3);`
`34`	`34`	`let lowMiddle = low + Math.floor((high - low) / 3);`
`35`	`35`	`if(key === arr[lowMiddle]){`
`36`	`36`	`return lowMiddle;`
`37`	`37`	`} else if(key === arr[highMiddle]){`
`38`	`38`	`return highMiddle;`
`39`		`- } else if(key === arr[high]){`
`40`		`- return high;`
`41`	`39`	`} else if(key < arr[lowMiddle]){`
`42`	`40`	`return ternarySearchRecursive(arr, low, lowMiddle - 1, key);`
`43`	`41`	`} else if(key > arr[lowMiddle] && key < arr[highMiddle]){`

Comments

(0)