algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2026-03-13 15:21:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixed Whitespace, Operators, and Quotes to Comply with JSLint

Browse Source 
I modified the whitespace in the files and changed single quotes to double quotes.

I also changed some `==` and `!=` operators to `===` and `!==` to comply with JSLint.
This commit is contained in:
PatOnTheBack
2019-06-27 10:41:44 -04:00
parent 2c1cd5595a
commit f37cac8508
8 changed files with 143 additions and 143 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
Search/binarySearch.js
View File

@@ -1,27 +1,27 @@
/*Binary Search-Search a sorted array by repeatedly dividing the search interval
* in half. Begin with an interval covering the whole array. If the value of the
* search key is less than the item in the middle of the interval, narrow the interval
* to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the
* value is found or the interval is empty.
*/
* in half. Begin with an interval covering the whole array. If the value of the
* search key is less than the item in the middle of the interval, narrow the interval
* to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the
* value is found or the interval is empty.
*/
function binarySearch(arr, i) {
var mid = Math.floor(arr.length / 2);
if (arr[mid] === i) {
console.log('match', arr[mid], i);
console.log("match", arr[mid], i);
return arr[mid];
} else if (arr[mid] < i && arr.length > 1) {
binarySearch(arr.splice(mid, Number.MAX_VALUE), i);
} else if (arr[mid] > i && arr.length > 1) {
binarySearch(arr.splice(0, mid), i);
} else {
console.log('not found', i);
console.log("not found", i);
return -1;
}
}
var ar=[1,2,3,4,5,6,7,8,9,10];
binarySearch(ar,3);
binarySearch(ar,7);
binarySearch(ar,13);
var ar = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
binarySearch(ar, 3);
binarySearch(ar, 7);
binarySearch(ar, 13);

30
Search/linearSearch.js
View File

@@ -1,24 +1,24 @@
/*
* Linear search or sequential search is a method for finding a target
* value within a list. It sequentially checks each element of the list
* for the target value until a match is found or until all the elements
* have been searched.
*/
* Linear search or sequential search is a method for finding a target
* value within a list. It sequentially checks each element of the list
* for the target value until a match is found or until all the elements
* have been searched.
*/
function SearchArray(searchNum, ar) {
var position = Search(ar, searchNum);
if (position != -1) {
console.log("The element was found at " + (position + 1));
} else {
console.log("The element not found");
}
var position = Search(ar, searchNum);
if (position != -1) {
console.log("The element was found at " + (position + 1));
} else {
console.log("The element not found");
}
}
// Search “theArray” for the specified “key” value
function Search(theArray, key) {
for (var n = 0; n < theArray.length; n++)
if (theArray[n] == key)
return n;
return -1;
for (var n = 0; n < theArray.length; n++)
if (theArray[n] == key)
return n;
return -1;
}
var ar = [1, 2, 3, 4, 5, 6, 7, 8, 9];