algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix grammar mistakes in JSDoc (#1127)

Browse Source
This commit is contained in:
Ivan Barsukov
2022-10-07 07:21:54 +02:00
committed by GitHub
parent 9a3d64c91f
commit b71815d50c
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Search/TernarySearch.js
View File

@ -1,12 +1,12 @@
/* Ternary search is similar to binary search but it divide the sorted array
* into three parts and determine which part the key lies in. The array will
/* Ternary search is similar to binary search but it divides the sorted array
* into three parts and determines which part the key lies in. The array will
* be divided into three intervals by using two middle points, mid1 and mid2.
* The value of the key will first compared with the two mid points, the value
* The value of the key will first be compared with the two mid points, the value
* will be returned if there is a match. Then, if the value of the key is less
* than mid1, narrow the interval to the first part. Else, if the value of the
* key is greater than mid2, narrow the interval to the third part. Otherwise,
* narrow the interval to the middle part. Repeat the steps until the value is
* found or the interval is empty(value not found after checking all elements).
* found or the interval is empty (value not found after checking all elements).
*
* Reference: https://www.geeksforgeeks.org/ternary-search/
*/