用二分搜索法求一个数的平方根的 Java 程序

原文:https://www . geesforgeks . org/Java-program-使用二进制搜索来查找数字的平方根/

给定一个非负数，使用二分搜索法方法求一个数的平方根。

例:

Input: x = 16
Output: 4
Explanation:  The square root of 16 is 4.

Input: x = 5
Output: 2
Explanation:  The square root of 5 lies in between
2 and 3 so floor of the square root is 2.

天真方法:

  • Check the square of each element until n, and store the answer until the square is less than or equal to n.

Java

// Java program to Find the square root of given numbers
// by brute force technique

import java.io.*;

class GFG {
    static int cuberoot(int n)
    {
        int ans = 0;

        for (int i = 1; i <= n; ++i) {

            // checking every number cube
            if (i * i <= n) {
                ans = i;
            }
        }
        return ans;
    }
    public static void main(String[] args)
    {
        // Number
        int number = 16;

        // Checking number
        int cuberoot = cuberoot(number);
        System.out.println(cuberoot);
    }
}

输出

4

版权属于：月萌API www.moonapi.com，转载请注明出处

本文链接：https://moonapi.com/news/22777.html