Skip to content
Related Articles

Related Articles

Improve Article

Calculate square of a number without using *, / and pow()

  • Difficulty Level : Medium
  • Last Updated : 23 Feb, 2021

Given an integer n, calculate the square of a number without using *, / and pow(). 

Examples : 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input: n = 5
Output: 25

Input: 7
Output: 49

Input: n = 12
Output: 144

A Simple Solution is to repeatedly add n to result. 



Below is the implementation of this idea. 

C++




// Simple solution to calculate square without
// using * and pow()
#include <iostream>
using namespace std;
 
int square(int n)
{
    // handle negative input
    if (n < 0)
        n = -n;
 
    // Initialize result
    int res = n;
 
    // Add n to res n-1 times
    for (int i = 1; i < n; i++)
        res += n;
 
    return res;
}
 
// Driver code
int main()
{
    for (int n = 1; n <= 5; n++)
        cout << "n = " << n << ", n^2 = " << square(n)
             << endl;
    return 0;
}
Java



// Java Simple solution to calculate
// square without using * and pow()
import java.io.*;
 
class GFG {
 
    public static int square(int n)
    {
 
        // handle negative input
        if (n < 0)
            n = -n;
 
        // Initialize result
        int res = n;
 
        // Add n to res n-1 times
        for (int i = 1; i < n; i++)
            res += n;
 
        return res;
    }
 
    // Driver code
    public static void main(String[] args)
    {
 
        for (int n = 1; n <= 5; n++)
            System.out.println("n = " + n
                               + ", n^2 = " + square(n));
    }
}
 
// This code is contributed by sunnysingh
Python3



# Simple solution to
# calculate square without
# using * and pow()
 
def square(n):
 
    # handle negative input
    if (n < 0):
        n = -n
 
    # Initialize result
    res = n
 
    # Add n to res n-1 times
    for i in range(1, n):
        res += n
 
    return res
 
 
# Driver Code
for n in range(1, 6):
    print("n =", n, end=", ")
    print("n^2 =", square(n))
 
# This code is contributed by
# Smitha Dinesh Semwal
C#



// C# Simple solution to calculate
// square without using * and pow()
using System;
 
class GFG {
    public static int square(int n)
    {
 
        // handle negative input
        if (n < 0)
            n = -n;
 
        // Initialize result
        int res = n;
 
        // Add n to res n-1 times
        for (int i = 1; i < n; i++)
            res += n;
 
        return res;
    }
 
    // Driver code
    public static void Main()
    {
 
        for (int n = 1; n <= 5; n++)
            Console.WriteLine("n = " + n
                              + ", n^2 = " + square(n));
    }
}
 
// This code is contributed by Sam007
PHP



<?php
// PHP implementation to
// calculate square
// without using * and pow()
 
function square($n)
{
 
// handle negative input
    if ($n < 0) $n = -$n;
 
// Initialize result
        $res = $n;
 
// Add n to res n-1 times
for ($i = 1; $i < $n; $i++)
    $res += $n;
 
return $res;
}
 
// Driver Code
for ($n = 1; $n<=5; $n++)
    echo "n = ", $n, ", ", "n^2 = ",
                  square($n), "\n ";
     
// This code is contributed by Ajit
?>
Javascript



<script>
 
// Simple solution to calculate square without
// using * and pow()
 
function square(n)
{
    // handle negative input
    if (n < 0)
        n = -n;
 
    // Initialize result
    let res = n;
 
    // Add n to res n-1 times
    for (let i = 1; i < n; i++)
        res += n;
 
    return res;
}
 
// Driver code
 
    for (let n = 1; n <= 5; n++)
        document.write("n= " + n +", n^2 = " + square(n)
            + "<br>");
     
 
//This code is contributed by Mayank Tyagi
 
</script>
Output
n = 1, n^2 = 1
n = 2, n^2 = 4
n = 3, n^2 = 9
n = 4, n^2 = 16
n = 5, n^2 = 25
The time complexity of the above solution is O(n). 
Approach 2:
We can do it in O(Logn) time using bitwise operators. The idea is based on the following fact.
  square(n) = 0 if n == 0
  if n is even 
     square(n) = 4*square(n/2) 
  if n is odd
     square(n) = 4*square(floor(n/2)) + 4*floor(n/2) + 1 

Examples
  square(6) = 4*square(3)
  square(3) = 4*(square(1)) + 4*1 + 1 = 9
  square(7) = 4*square(3) + 4*3 + 1 = 4*9 + 4*3 + 1 = 49
How does this work? 
If n is even, it can be written as
  n = 2*x 
  n2 = (2*x)2 = 4*x2
If n is odd, it can be written as 
  n = 2*x + 1
  n2 = (2*x + 1)2 = 4*x2 + 4*x + 1
floor(n/2) can be calculated using a bitwise right shift operator. 2*x and 4*x can be calculated 
Below is the implementation based on the above idea. 


C++



// Square of a number using bitwise operators
#include <bits/stdc++.h>
using namespace std;
 
int square(int n)
{
    // Base case
    if (n == 0)
        return 0;
 
    // Handle negative number
    if (n < 0)
        n = -n;
 
    // Get floor(n/2) using right shift
    int x = n >> 1;
 
    // If n is odd
    if (n & 1)
        return ((square(x) << 2) + (x << 2) + 1);
    else // If n is even
        return (square(x) << 2);
}
 
// Driver Code
int main()
{
    // Function calls
    for (int n = 1; n <= 5; n++)
        cout << "n = " << n << ", n^2 = " << square(n)
             << endl;
    return 0;
}
Java



// Square of a number using
// bitwise operators
class GFG {
    static int square(int n)
    {
 
        // Base case
        if (n == 0)
            return 0;
 
        // Handle negative number
        if (n < 0)
            n = -n;
 
        // Get floor(n/2) using
        // right shift
        int x = n >> 1;
 
        // If n is odd
        ;
        if (n % 2 != 0)
            return ((square(x) << 2) + (x << 2) + 1);
        else // If n is even
            return (square(x) << 2);
    }
 
    // Driver code
    public static void main(String args[])
    {
        // Function calls
        for (int n = 1; n <= 5; n++)
            System.out.println("n = " + n
                               + " n^2 = " + square(n));
    }
}
 
// This code is contributed by Sam007
Python3



# Square of a number using bitwise
# operators
 
 
def square(n):
 
    # Base case
    if (n == 0):
        return 0
 
    # Handle negative number
    if (n < 0):
        n = -n
 
    # Get floor(n/2) using
    # right shift
    x = n >> 1
 
    # If n is odd
    if (n & 1):
        return ((square(x) << 2)
                + (x << 2) + 1)
 
    # If n is even
    else:
        return (square(x) << 2)
 
 
# Driver Code
for n in range(1, 6):
    print("n = ", n, " n^2 = ",
          square(n))
# This code is contributed by Sam007
C#



// Square of a number using bitwise
// operators
using System;
 
class GFG {
 
    static int square(int n)
    {
 
        // Base case
        if (n == 0)
            return 0;
 
        // Handle negative number
        if (n < 0)
            n = -n;
 
        // Get floor(n/2) using
        // right shift
        int x = n >> 1;
 
        // If n is odd
        ;
        if (n % 2 != 0)
            return ((square(x) << 2) + (x << 2) + 1);
        else // If n is even
            return (square(x) << 2);
    }
 
    // Driver code
    static void Main()
    {
        for (int n = 1; n <= 5; n++)
            Console.WriteLine("n = " + n
                              + " n^2 = " + square(n));
    }
}
 
// This code is contributed by Sam0007.
PHP



<?php
// Square of a number using
// bitwise operators
 
function square($n)
{
     
    // Base case
    if ($n==0) return 0;
 
    // Handle negative number
    if ($n < 0) $n = -$n;
 
    // Get floor(n/2)
    // using right shift
    $x = $n >> 1;
 
    // If n is odd
    if ($n & 1)
        return ((square($x) << 2) +
                    ($x << 2) + 1);
    else // If n is even
        return (square($x) << 2);
}
 
    // Driver Code
    for ($n = 1; $n <= 5; $n++)
        echo "n = ", $n, ", n^2 = ", square($n),"\n";
     
// This code is contributed by ajit
?>
Javascript



<script>
 
// Square of a number using bitwise operators
 
function square(n)
{
    // Base case
    if (n == 0)
        return 0;
 
    // Handle negative number
    if (n < 0)
        n = -n;
 
    // Get floor(n/2) using right shift
    let x = n >> 1;
 
    // If n is odd
    if (n & 1)
        return ((square(x) << 2) + (x << 2) + 1);
    else // If n is even
        return (square(x) << 2);
}
 
// Driver Code
  // Function calls
    for (let n = 1; n <= 5; n++)
        document.write("n = " + n + ", n^2 = " + square(n)
             +"<br>");
    
 
//This code is contributed by Mayank Tyagi
 
</script>
Output
n = 1, n^2 = 1
n = 2, n^2 = 4
n = 3, n^2 = 9
n = 4, n^2 = 16
n = 5, n^2 = 25
The time complexity of the above solution is O(Logn).
Approach 3:
For a given number `num` we get square of it by multiplying number as `num * num`. 
Now write one of `num` in square `num * num` in terms of power of `2`. Check below examples.

Eg: num = 10, square(num) = 10 * 10 
                          = 10 * (8 + 2) = (10 * 8) + (10 * 2)
    num = 15, square(num) = 15 * 15 
                          = 15 * (8 + 4 + 2 + 1) = (15 * 8) + (15 * 4) + (15 * 2) + (15 * 1)

Multiplication with power of 2's can be done by left shift bitwise operator.
Below is the implementation based on the above idea. 
C++



// Simple solution to calculate square without
// using * and pow()
#include <iostream>
using namespace std;
 
int square(int num)
{
    // handle negative input
    if (num < 0) num = -num;
 
    // Initialize result
    int result = 0, times = num;
 
    while (times > 0)
    {
        int possibleShifts = 0, currTimes = 1;
 
        while ((currTimes << 1) <= times)
        {
            currTimes = currTimes << 1;
            ++possibleShifts;
        }
 
        result = result + (num << possibleShifts);
        times = times - currTimes;
    }
 
    return result;
}
 
// Driver code
int main()
{
    // Function calls
    for (int n = 10; n <= 15; ++n)
        cout << "n = " << n << ", n^2 = " << square(n) << endl;
    return 0;
}
 
// This code is contributed by sanjay235
Java



// Simple solution to calculate square
// without using * and pow()
import java.io.*;
 
class GFG{
     
public static int square(int num)
{
     
    // Handle negative input
    if (num < 0)
        num = -num;
 
    // Initialize result
    int result = 0, times = num;
 
    while (times > 0)
    {
        int possibleShifts = 0,
                 currTimes = 1;
 
        while ((currTimes << 1) <= times)
        {
            currTimes = currTimes << 1;
            ++possibleShifts;
        }
 
        result = result + (num << possibleShifts);
        times = times - currTimes;
    }
    return result;
}
 
// Driver code
public static void main(String[] args)
{
    for(int n = 10; n <= 15; ++n)
    {
        System.out.println("n = " + n +
                           ", n^2 = " +
                           square(n));
    }
}
}
 
// This code is contributed by RohitOberoi
Python3



# Simple solution to calculate square without
# using * and pow()
def square(num):
 
    # Handle negative input
    if (num < 0):
        num = -num
 
    # Initialize result
    result, times = 0, num
 
    while (times > 0):
        possibleShifts, currTimes = 0, 1
 
        while ((currTimes << 1) <= times):
            currTimes = currTimes << 1
            possibleShifts += 1
 
        result = result + (num << possibleShifts)
        times = times - currTimes
 
    return result
 
# Driver Code
 
# Function calls
for n in range(10, 16):
    print("n =", n, ", n^2 =", square(n))
 
# This code is contributed by divyesh072019
C#



// Simple solution to calculate square
// without using * and pow()
using System;
class GFG {
     
    static int square(int num)
    {
          
        // Handle negative input
        if (num < 0)
            num = -num;
      
        // Initialize result
        int result = 0, times = num;
      
        while (times > 0)
        {
            int possibleShifts = 0,
                     currTimes = 1;
      
            while ((currTimes << 1) <= times)
            {
                currTimes = currTimes << 1;
                ++possibleShifts;
            }
      
            result = result + (num << possibleShifts);
            times = times - currTimes;
        }
        return result;
    }
     
  static void Main() {
        for(int n = 10; n <= 15; ++n)
        {
            Console.WriteLine("n = " + n +
                               ", n^2 = " +
                               square(n));
        }
  }
}
 
// This code is contributed by divyeshrabadiy07
Javascript



<script>
 
// Simple solution to calculate square without
// using * and pow()
 
function square(num)
{
    // handle negative input
    if (num < 0) num = -num;
 
    // Initialize result
    let result = 0, times = num;
 
    while (times > 0)
    {
        let possibleShifts = 0, currTimes = 1;
 
        while ((currTimes << 1) <= times)
        {
            currTimes = currTimes << 1;
            ++possibleShifts;
        }
 
        result = result + (num << possibleShifts);
        times = times - currTimes;
    }
 
    return result;
}
 
// Driver code
 
    // Function calls
    for (let n = 10; n <= 15; ++n)
        document.write("n = " + n + ", n^2 = " + square(n) + "<br>");
 
//This code is contributed by Mayank Tyagi
 
</script>
Output
n = 10, n^2 = 100
n = 11, n^2 = 121
n = 12, n^2 = 144
n = 13, n^2 = 169
n = 14, n^2 = 196
n = 15, n^2 = 225
The time complexity of the above solution is O(Log n).  Thanks to Sanjay for approach 3 solution.
This article is contributed by Ujjwal Jain. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
 



My Personal Notes
arrow_drop_up
Previous
The Skyline Problem using Divide and Conquer algorithm
Next

Puzzle 13 | (100 Prisoners with Red/Black Hats)
Recommended Articles
Page :
Calculate 7n/8 without using division and multiplication operators
26, May 15
Multiply a number by 15 without using * and / operators
21, May 19
Multiply a number with 10 without using multiplication operator
11, Nov 16
Increment a number without using ++ or +
30, Aug 18
Find XOR of two number without using XOR operator
21, Oct 15
Calculate Bitwise OR of two integers from their given Bitwise AND and Bitwise XOR values
02, Dec 20
Check if two numbers are equal without using arithmetic and comparison operators
03, Sep 15
Divide two integers without using multiplication, division and mod operator
05, Feb 18
Queries to calculate Bitwise AND of an array with updates
08, Apr 21
Minimum digits to remove to make a number Perfect Square
12, Apr 18
Check a number is odd or even without modulus operator
19, Apr 18
Count number of binary strings without consecutive 1’s : Set 2
03, Apr 20
Swap three variables without using temporary variable
19, Sep 16
Multiplying a variable with a constant without using multiplication operator
30, Nov 16
Reverse an array without using subtract sign ‘-‘ anywhere in the code
21, May 17
Check if two numbers are equal without using comparison operators
03, Aug 17
Efficiently find first repeated character in a string without using any additional data structure in one traversal
21, Aug 17
Find largest element from array without using conditional operator
04, Dec 17
Smallest perfect power of 2 greater than n (without using arithmetic operators)
08, Dec 17
Printing all subsets of {1,2,3,...n} without using array or loop
30, Oct 18
Maximum OR value of a pair in an Array without using OR operator
08, May 20
Add two numbers without using arithmetic operators
17, Mar 12
Subtract two numbers without using arithmetic operators
29, Mar 15
Check if n is divisible by power of 2 without using arithmetic operators
17, Dec 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox