classroomX Home

LIVE

binary-search.js

notes.md

1

2

3

4

5

6

7

8

9

10

11

12

function binarySearch(items, target) {

let low = 0;

let high = items.length - 1;

while (low <= high) {

const mid = Math.floor((low + high) / 2);

if (items[mid] === target) return mid;

if (items[mid] < target) low = mid + 1;

else high = mid - 1;

}

return -1;

}

AMJKLS+12

15 participants

Built for teaching code live

Every student's editor, right when they need you.

Broadcast your code, follow progress in real time, and jump directly to the line where a student is stuck.

Welcome back

Loading your secure sign-in form.

Loading…

classroomX Home

LIVE

binary-search.js

notes.md

1

2

3

4

5

6

7

8

9

10

11

12

function binarySearch(items, target) {

let low = 0;

let high = items.length - 1;

while (low <= high) {

const mid = Math.floor((low + high) / 2);

if (items[mid] === target) return mid;

if (items[mid] < target) low = mid + 1;

else high = mid - 1;

}

return -1;

}

AMJKLS+12

15 participants

Built for teaching code live

Every student's editor, right when they need you.

Broadcast your code, follow progress in real time, and jump directly to the line where a student is stuck.

Create your account

Free to start. Create a classroom or join one with a code.

Loading…