CodeCow/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-06-05 21:04:28 +08:00
Code Issues Actions 3 Packages Projects Releases Wiki Activity

fix(curriculum): editable regions in workshop binary search js (#67793)

Browse Source
This commit is contained in:
Aditya Singh 2026-06-03 22:54:23 +05:30 committed by GitHub
parent 2e40de1662
commit 58df87f2f4
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
13 changed files with 29 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
curriculum/challenges/english/blocks/workshop-binary-search-js/6996c7363a4a437839f1f15d.md
View File

@ -34,6 +34,7 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
--fcc-editable-region--
--fcc-editable-region--

3
curriculum/challenges/english/blocks/workshop-binary-search-js/6996c796385b6ea4e222d5e8.md
View File

@ -33,9 +33,10 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
--fcc-editable-region--
--fcc-editable-region--
}
}

1
curriculum/challenges/english/blocks/workshop-binary-search-js/6996c8375f4301004459ee85.md
View File

@ -31,6 +31,7 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
--fcc-editable-region--

1
curriculum/challenges/english/blocks/workshop-binary-search-js/6996c8f94fe6b250f11a2a1e.md
View File

@ -29,6 +29,7 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];

2
curriculum/challenges/english/blocks/workshop-binary-search-js/6996c95e5bede03bdf2937a2.md
View File

@ -40,10 +40,12 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
--fcc-editable-region--
--fcc-editable-region--

2
curriculum/challenges/english/blocks/workshop-binary-search-js/6996ca21a74104721f2c7e5d.md
View File

@ -39,10 +39,12 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return pathToTarget;
}

2
curriculum/challenges/english/blocks/workshop-binary-search-js/6996cb5869acf58de751ae81.md
View File

@ -40,10 +40,12 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return pathToTarget;
}

4
curriculum/challenges/english/blocks/workshop-binary-search-js/6996ccadf9048c79b857bb15.md
View File

@ -33,13 +33,15 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
--fcc-editable-region--
if (value === valueAtMiddle) {
return pathToTarget;
--fcc-editable-region--
}
--fcc-editable-region--
break;

6
curriculum/challenges/english/blocks/workshop-binary-search-js/6996cdf1f60cbc30eeeae1c9.md
View File

@ -28,19 +28,19 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return pathToTarget;
} else if (value > valueAtMiddle) {
--fcc-editable-region--
--fcc-editable-region--
}
break;
}
return [];

7
curriculum/challenges/english/blocks/workshop-binary-search-js/6996cfb6c01e9a802add38be.md
View File

@ -31,21 +31,20 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return pathToTarget;
} else if (value > valueAtMiddle) {
low = mid + 1;
}
--fcc-editable-region--
}
break;
--fcc-editable-region--
}
return [];
}

3
curriculum/challenges/english/blocks/workshop-binary-search-js/6996d0a2c2ac55041145a13f.md
View File

@ -33,11 +33,12 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return pathToTarget;
} else if (value > valueAtMiddle) {

5
curriculum/challenges/english/blocks/workshop-binary-search-js/6996d1032feed88e2957dc8e.md
View File

@ -29,11 +29,12 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return pathToTarget;
} else if (value > valueAtMiddle) {
@ -43,7 +44,7 @@ function binarySearch(searchList, value) {
}
}
--fcc-editable-region--
return [];
return [];
--fcc-editable-region--
}

10
curriculum/challenges/english/blocks/workshop-binary-search-js/6996d18b31aab5cbbffbc731.md
View File

@ -33,16 +33,16 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
--fcc-editable-region--
return pathToTarget;
--fcc-editable-region--
} else if (value > valueAtMiddle) {
low = mid + 1;
} else {
@ -50,7 +50,6 @@ function binarySearch(searchList, value) {
}
}
return [[], "Value not found"];
}
console.log(binarySearch([1, 2, 3, 4, 5], 3));
@ -65,12 +64,12 @@ function binarySearch(searchList, value) {
let pathToTarget = [];
let low = 0;
let high = searchList.length - 1;
while (low <= high) {
let mid = Math.floor((low + high) / 2);
let valueAtMiddle = searchList[mid];
pathToTarget.push(valueAtMiddle);
if (value === valueAtMiddle) {
return [pathToTarget, `Value found at index ${mid}`];
} else if (value > valueAtMiddle) {
@ -79,7 +78,6 @@ function binarySearch(searchList, value) {
high = mid - 1;
}
}
return [[], "Value not found"];
}