Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Mountain Peak | Problems
Binary Search in Python
course content

Course Content

Binary Search in Python

Binary Search in Python

1. Binary Search
BinarySearch 1/2Binary Search 2/2
2. Problems
Sqrt(n)Arrays IntersectionMountain PeakBalloonsDivision

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!

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Everything was clear?

Section 2. Chapter 3
toggle bottom row

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!

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Everything was clear?

Section 2. Chapter 3
toggle bottom row

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!

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Everything was clear?

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!

Task

  1. Set the middle variable. The middle equals the left + (right - left)//2.
  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].
  3. Set condition if the left element is greater than the middle element.
  4. Perform the recursion with the left part of the array.
  5. Perform the recursion with the right part of the array.
  6. Test the function.

Section 2. Chapter 3
Switch to desktop for real-world practiceContinue from where you are using one of the options below
We're sorry to hear that something went wrong. What happened?
some-alt