Program for Square Root of Integer
Last Updated :
12 Aug, 2025
Given a positive integer n, find its square root. If n is not a perfect square, then return floor of √n.
Examples :
Input: n = 4
Output: 2
Explanation: The square root of 4 is 2.
Input: n = 11
Output: 3
Explanation: The square root of 11 lies in between 3 and 4 so floor of the square root is 3.
[Naive Approach] Using a loop - O(sqrt(n)) Time and O(1) Space
Start from 1 and square each number until the square exceeds the given number. The last number whose square is less than or equal to n is the answer.
C++
#include <iostream>
using namespace std;
int floorSqrt(int n) {
// start iteration from 1 until the
// square of a number exceeds n
int res = 1;
while(res*res <= n){
res++;
}
// return the largest integer whose
// square is less than or equal to n
return res - 1;
}
int main() {
int n = 11;
cout << floorSqrt(n);
return 0;
}
#include <stdio.h>
int floorSqrt(int n) {
// start iteration from 1 until the
// square of a number exceeds n
int res = 1;
while (res * res <= n) {
res++;
}
// return the largest integer whose
// square is less than or equal to n
return res - 1;
}
int main() {
int n = 11;
printf("%d", floorSqrt(n));
return 0;
}
class GfG {
static int floorSqrt(int n) {
// start iteration from 1 until the
// square of a number exceeds n
int res = 1;
while (res * res <= n) {
res++;
}
// return the largest integer whose
// square is less than or equal to n
return res - 1;
}
public static void main(String[] args) {
int n = 11;
System.out.println(floorSqrt(n));
}
}
def floorSqrt(n):
# start iteration from 1 until the
# square of a number exceeds n
res = 1
while res * res <= n:
res += 1
# return the largest integer whose
# square is less than or equal to n
return res - 1
if __name__ == "__main__":
n = 11
print(floorSqrt(n))
using System;
class GfG {
static int floorSqrt(int n) {
// start iteration from 1 until the
// square of a number exceeds n
int res = 1;
while (res * res <= n) {
res++;
}
// return the largest integer whose
// square is less than or equal to n
return res - 1;
}
static void Main() {
int n = 11;
Console.WriteLine(floorSqrt(n));
}
}
function floorSqrt(n) {
// start iteration from 1 until the
// square of a number exceeds n
let res = 1;
while (res * res <= n) {
res++;
}
// return the largest integer whose
// square is less than or equal to n
return res - 1;
}
// Driver Code
let n = 11;
console.log(floorSqrt(n));
[Expected Approach] Using Binary Search - O(log(n)) Time and O(1) Space
The square of a number increases as the number increases, so the square root of n must lie in a sorted (monotonic) range.
If a number's square is more than n, the square root must be smaller.
If it's less than or equal to n, the square root could be that number or greater.
Because of this pattern, we can apply binary search in the range 1 to n to efficiently find the square root.
C++
#include <iostream>
using namespace std;
int floorSqrt(int n) {
// initial search space
int lo = 1, hi = n;
int res = 1;
while(lo <= hi) {
int mid = lo + (hi - lo)/2;
// if square of mid is less than or equal to n
// update the result and search in upper half
if(mid*mid <= n) {
res = mid;
lo = mid + 1;
}
// if square of mid exceeds n,
// search in the lower half
else {
hi = mid - 1;
}
}
return res;
}
int main() {
int n = 11;
cout << floorSqrt(n);
return 0;
}
#include <stdio.h>
int floorSqrt(int n) {
// initial search space
int lo = 1, hi = n;
int res = 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
// if square of mid is less than or equal to n
// update the result and search in upper half
if (mid * mid <= n) {
res = mid;
lo = mid + 1;
}
// if square of mid exceeds n,
// search in the lower half
else {
hi = mid - 1;
}
}
return res;
}
int main() {
int n = 11;
printf("%d", floorSqrt(n));
return 0;
}
class GfG {
static int floorSqrt(int n) {
// initial search space
int lo = 1, hi = n;
int res = 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
// if square of mid is less than or equal to n
// update the result and search in upper half
if (mid * mid <= n){
res = mid;
lo = mid + 1;
}
// if square of mid exceeds n,
// search in the lower half
else {
hi = mid - 1;
}
}
return res;
}
public static void main(String[] args) {
int n = 11;
System.out.println(floorSqrt(n));
}
}
def floorSqrt(n):
# initial search space
lo = 1
hi = n
res = 1
while lo <= hi:
mid = lo + (hi - lo) // 2
# if square of mid is less than or equal to n
# update the result and search in upper half
if mid * mid <= n:
res = mid
lo = mid + 1
# if square of mid exceeds n,
# search in the lower half
else:
hi = mid - 1
return res
if __name__ == "__main__":
n = 11
print(floorSqrt(n))
using System;
class GfG {
static int floorSqrt(int n) {
// initial search space
int lo = 1, hi = n;
int res = 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
// if square of mid is less than or equal to n
// update the result and search in upper half
if (mid * mid <= n) {
res = mid;
lo = mid + 1;
}
// if square of mid exceeds n,
// search in the lower half
else {
hi = mid - 1;
}
}
return res;
}
static void Main() {
int n = 11;
Console.WriteLine(floorSqrt(n));
}
}
function floorSqrt(n) {
// initial search space
let lo = 1, hi = n;
let res = 1;
while (lo <= hi) {
let mid = lo + Math.floor((hi - lo) / 2);
// if square of mid is less than or equal to n
// update the result and search in upper half
if (mid * mid <= n) {
res = mid;
lo = mid + 1;
}
// if square of mid exceeds n,
// search in the lower half
else {
hi = mid - 1;
}
}
return res;
}
// Driver Code
let n = 11;
console.log(floorSqrt(n));
[Alternate Approach] Using Built In functions - O(log(n)) Time and O(1) Space
We can directly use built in functions to find square root of an integer.
C++
#include <iostream>
#include <cmath>
using namespace std;
int floorSqrt(int n) {
// square root using sqrt function, it returns
// the double value, which is casted to integer
int res = sqrt(n);
// use sqrtl for big numbers
return res;
}
int main() {
int n = 11;
cout << floorSqrt(n);
return 0;
}
#include <stdio.h>
#include <math.h>
int floorSqrt(int n) {
// square root using sqrt function, it returns
// the double value, which is casted to integer
int res = sqrt(n);
return res;
}
int main() {
int n = 11;
printf("%d", floorSqrt(n));
return 0;
}
class GfG {
static int floorSqrt(int n) {
// square root using sqrt function, it returns
// the double value, which is casted to integer
int res = (int)Math.sqrt(n);
return res;
}
public static void main(String[] args) {
int n = 11;
System.out.println(floorSqrt(n));
}
}
import math
def floorSqrt(n):
# square root using sqrt function, it returns
# the double value, which is casted to integer
res = int(math.sqrt(n))
return res
if __name__ == "__main__":
n = 11
print(floorSqrt(n))
using System;
class GfG {
static int floorSqrt(int n) {
// square root using sqrt function, it returns
// the double value, which is casted to integer
int res = (int)Math.Sqrt(n);
return res;
}
static void Main() {
int n = 11;
Console.WriteLine(floorSqrt(n));
}
}
function floorSqrt(n) {
// square root using sqrt function, it returns
// the double value, which is casted to integer
let res = Math.floor(Math.sqrt(n));
return res;
}
// Driver Code
let n = 11;
console.log(floorSqrt(n));
The idea is to use mathematical formula √n = e1/2 × log(n) to compute the square root of an integer n.
Let's say square root of n is x:
=> x = √n
Squaring both the sides:
=> x2 =n
Taking log on both the sides:
=> log(x2) = log(n)
=> 2 × log(x) = log(n)
=> log(x) = 1/2 × log(n)
To isolate x, exponentiate both sides with base e:
=> x = e1/2 * log(n)
x is the square root of n:
So, √n = e1/2 × log(n)
Because of the way computations are done in computers in case of decimals, the result from the expression may be slightly less than the actual square root. Therefore, we will also consider the next integer after the calculated result as a potential answer.
C++
#include <iostream>
#include <cmath>
using namespace std;
int floorSqrt(int n) {
// calculating square root using
// mathematical formula
int res = exp(0.5 * log(n));
// If square of res + 1 is less than or equal to n
// then, it will be our answer
if ((res + 1) * (res + 1) <= n) {
res++;
}
return res;
}
int main() {
int n = 11;
cout << floorSqrt(n);
return 0;
}
#include <stdio.h>
#include <math.h>
int floorSqrt(int n) {
// calculating square root using
// mathematical formula
int res = exp(0.5 * log(n));
// if square of res + 1 is less than or equal to n
// then, it will be our answer
if ((res + 1) * (res + 1) <= n) {
res++;
}
return res;
}
int main() {
int n = 11;
printf("%d", floorSqrt(n));
return 0;
}
class GfG {
static int floorSqrt(int n) {
// calculating square root using
// mathematical formula
int res = (int)Math.exp(0.5 * Math.log(n));
// If square of res + 1 is less than or equal to n
// then, it will be our answer
if ((res + 1) * (res + 1) <= n) {
res++;
}
return res;
}
public static void main(String[] args) {
int n = 11;
System.out.println(floorSqrt(n));
}
}
import math
def floorSqrt(n):
# calculating square root using
# mathematical formula
res = int(math.exp(0.5 * math.log(n)))
# If square of res + 1 is less than or equal to n
# then, it will be our answer
if (res + 1) ** 2 <= n:
res += 1
return res
if __name__ == "__main__":
n = 11
print(floorSqrt(n))
using System;
class GfG {
static int floorSqrt(int n) {
// calculating square root using
// mathematical formula
int res = (int)Math.Exp(0.5 * Math.Log(n));
// If square of res + 1 is less than or equal to n
// then, it will be our answer
if ((long)(res + 1) * (res + 1) <= n) {
res++;
}
return res;
}
static void Main() {
int n = 11;
Console.WriteLine(floorSqrt(n));
}
}
function floorSqrt(n) {
// calculating square root using
// mathematical formula
let res = Math.floor(Math.exp(0.5 * Math.log(n)));
// if square of res + 1 is less than or equal to n
// then, it will be our answer
if ((res + 1) * (res + 1) <= n) {
res++;
}
return res;
}
// Driver Code
let n = 11;
console.log(floorSqrt(n));
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem