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!
Swipe to start coding
- Set condition if the
xequals0or1. - Set the while loop to work while the
leftis lower or equals theright. - 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. Theleftequals themiddle + 1. - Update the
result. Theresultequals themiddle. - Update the
right. Therightequals themiddle - 1. - Test the function.
Soluzione
Grazie per i tuoi commenti!
single
Chieda ad AI
Chieda ad AI
Chieda pure quello che desidera o provi una delle domande suggerite per iniziare la nostra conversazione
Riassuma questo capitolo
Explain code
Explain why doesn't solve task
Awesome!
Completion rate improved to 14.29
Sqrt(n)
Scorri per mostrare il menu
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!
Swipe to start coding
- Set condition if the
xequals0or1. - Set the while loop to work while the
leftis lower or equals theright. - 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. Theleftequals themiddle + 1. - Update the
result. Theresultequals themiddle. - Update the
right. Therightequals themiddle - 1. - Test the function.
Soluzione
Grazie per i tuoi commenti!
single