JAVA帮忙

The Bisection method is a simple example of numerical algorithms for solving equations. The algorithm uses the classic divide and conquer strategy. Begin with an interval that contains the unknown solution. Divide it in half, discard the half that does not contain the solution, and repeat.
Write a program that implements the Bisection Algorithm to solve the equation

which has the same solution as the equation

public class test
{
static double F( double x )
{
return Math.sqrt( x ) - Math.cos( x );
}
public static void main(String[] args) {
double l = 0, r = Math.PI/2;
final double TOL = 0.5e-7;
double m;
while ( Math.abs( r - l ) > TOL*2 ) {
m = ( r + l ) / 2;
if ( F( l ) * F( m ) > 0 ) {
l = m;
} else {
r = m;
}
}
m = (r + l) / 2;
System.out.println( "root: " + m );
}
}