Contenido del Curso

Binary Search in Python

1. Binary Search

2. Problems

Sqrt(n)Arrays Intersection Mountain Peak Balloons Division

Mountain Peak

Have you ever been to the mountains? If not, I hope you still have a chance!

Imagine we have the array with the height of a mountain at specific points. And we need to find the peak value of the mountain in this array.

The peak means that points to the left and right are less than the peak point.

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

Use hints if needed! Be careful with the tabulation!

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

¿Todo estuvo claro?

Sección 2. Capítulo 3

Mountain Peak

Have you ever been to the mountains? If not, I hope you still have a chance!

Imagine we have the array with the height of a mountain at specific points. And we need to find the peak value of the mountain in this array.

The peak means that points to the left and right are less than the peak point.

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

Use hints if needed! Be careful with the tabulation!

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

¿Todo estuvo claro?

Sección 2. Capítulo 3

Mountain Peak

Have you ever been to the mountains? If not, I hope you still have a chance!

Imagine we have the array with the height of a mountain at specific points. And we need to find the peak value of the mountain in this array.

The peak means that points to the left and right are less than the peak point.

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

Use hints if needed! Be careful with the tabulation!

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

¿Todo estuvo claro?

Have you ever been to the mountains? If not, I hope you still have a chance!

Imagine we have the array with the height of a mountain at specific points. And we need to find the peak value of the mountain in this array.

The peak means that points to the left and right are less than the peak point.

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

Use hints if needed! Be careful with the tabulation!

Tarea

Set the middle variable. The middle equals the left + (right - left)//2.
Set condition if the right and the left elements are lower or equal to the middle element. The left element: arr[middle - 1]. The right element: arr[middle + 1].
Set condition if the left element is greater than the middle element.
Perform the recursion with the left part of the array.
Perform the recursion with the right part of the array.
Test the function.

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones

Sección 2. Capítulo 3

Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones