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

Svep för att visa menyn

book
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!

Uppgift

Swipe to start coding

  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.

Lösning

Switch to desktopByt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedan
Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 2. Kapitel 3
single

single

Fråga AI

expand

Fråga AI

ChatGPT

Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal

close

Awesome!

Completion rate improved to 14.29

book
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!

Uppgift

Swipe to start coding

  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.

Lösning

Switch to desktopByt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedan
Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

close

Awesome!

Completion rate improved to 14.29

Svep för att visa menyn

some-alt