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.
Solution
Merci pour vos commentaires !
single
Demandez à l'IA
Demandez à l'IA
Posez n'importe quelle question ou essayez l'une des questions suggérées pour commencer notre discussion
Résumer ce chapitre
Expliquer le code dans file
Expliquer pourquoi file ne résout pas la tâche
Awesome!
Completion rate improved to 14.29Sqrt(n)
Glissez pour afficher le 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.
Solution
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessousMerci pour vos commentaires !
Awesome!
Completion rate improved to 14.29single
