Binary Search in Python

Зміст курсу

Binary Search in Python

Binary Search in Python

1. Binary Search

BinarySearch 1/2 Binary Search 2/2

2. Problems

Sqrt(n)Arrays Intersection Mountain Peak Balloons Division

Sqrt(n)

In this section, we will practice with the BS algorithm.

The first task will be to find the square root of the number.

Look at the explanation of the task! How does it work?

Use hints if needed! Be careful with the tabulation!

Let's practice!

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Все було зрозуміло?

Секція 2. Розділ 1

toggle bottom row

Sqrt(n)

In this section, we will practice with the BS algorithm.

The first task will be to find the square root of the number.

Look at the explanation of the task! How does it work?

Use hints if needed! Be careful with the tabulation!

Let's practice!

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Все було зрозуміло?

Секція 2. Розділ 1

toggle bottom row

Sqrt(n)

In this section, we will practice with the BS algorithm.

The first task will be to find the square root of the number.

Look at the explanation of the task! How does it work?

Use hints if needed! Be careful with the tabulation!

Let's practice!

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Все було зрозуміло?

In this section, we will practice with the BS algorithm.

The first task will be to find the square root of the number.

Look at the explanation of the task! How does it work?

Use hints if needed! Be careful with the tabulation!

Let's practice!

Завдання

Set condition if the x equals 0 or 1.
Set the while loop to work while the left is lower or equals the right.
Set condition if the square of the middle elements equals x.
Set condition if the square of the middle elements is lower than x.
Update the left. The left equals the middle + 1.
Update the result. The result equals the middle.
Update the right. The right equals the middle - 1.
Test the function.

Секція 2. Розділ 1

Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантів

some-alt