Skip to content
Related Articles

Related Articles

Reverse an array without using subtract sign ‘-‘ anywhere in the code
  • Difficulty Level : Medium
  • Last Updated : 24 Jun, 2019

Given an array, the task is to reverse the array without using subtract sign ‘-‘ anywhere in your code. It is not tough to reverse an array but the main thing is to not use ‘-‘ operator.

Asked in: Moonfrog Interview

Below are different approaches:

Method 1:
1- Store array elements into a vector in C++.
2- Then reverse the vector using predefined functions.
3- Then store reversed elements into the array back.



Method 2:
1- Store array elements into a stack.
2- As the stack follows Last In First Out, so we can store elements from
top of the stack into the array which will be itself in a reverse manner.

Method 3:
1- In this method, the idea is to use a negative sign but by storing it into a variable.
2- By using this statement x = (INT_MIN/INT_MAX), we get -1 in a variable x.
3- As INT_MIN and INT_MAX have same values just of opposite signs, so on dividing them it will give -1.
4- Then ‘x’ can be used in decrementing the index from last.

C++




// C++ program to reverse an array without
// using "-" sign
#include <bits/stdc++.h>
using namespace std;
  
// Function to reverse array
void reverseArray(int arr[], int n)
{
    // Trick to assign -1 to a variable
    int x = (INT_MIN / INT_MAX);
  
    // Reverse array in simple manner
    for (int i = 0; i < n / 2; i++)
  
        // Swap ith index value with (n-i-1)th
        // index value
        swap(arr[i], arr[n + (x * i) + x]);
}
  
// Drivers code
int main()
{
    int arr[] = { 5, 3, 7, 2, 1, 6 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    reverseArray(arr, n);
  
    // print the reversed array
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
  
    return 0;
}
Java



// Java program to reverse an array without
// using "-" sign
class GFG {
  
    // Function to reverse array
    static void reverseArray(int arr[], int n)
    {
        // Trick to assign -1 to a variable
        int x = (Integer.MIN_VALUE / Integer.MAX_VALUE);
  
        // Reverse array in simple manner
        for (int i = 0; i < n / 2; i++)
  
            // Swap ith index value with (n-i-1)th
            // index value
            swap(arr, i, n + (x * i) + x);
    }
    static int[] swap(int[] arr, int i, int j)
    {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
        return arr;
    }
  
    // Drivers code
    public static void main(String[] args)
    {
        int arr[] = { 5, 3, 7, 2, 1, 6 };
        int n = arr.length;
  
        reverseArray(arr, n);
  
        // print the reversed array
        for (int i = 0; i < n; i++)
            System.out.print(arr[i] + " ");
    }
}
  
// This code has been contributed by 29AjayKumar
Python3



# Python program to reverse an array without
# using "-" sign
  
# Function to reverse array
def reverseArray(arr, n):
  
    import sys
  
    # Trick to assign - 1 to a variable
    x = -sys.maxsize // sys.maxsize
  
    # Reverse array in simple manner
    for i in range(n//2):
  
        # Swap ith index value with (n-i-1)th
        # index value
        arr[i], arr[n + (x*i) + x] = arr[n + (x*i) + x], arr[i]
  
  
# Driver code
if __name__ == "__main__":
    arr = [5, 3, 7, 2, 1, 6]
    n = len(arr)
  
    reverseArray(arr, n)
  
    # print the reversed array
    for i in range(n):
        print(arr[i], end=" ")
  
# This code is contributed by
# sanjeev2552
C#



// C# program to reverse an array without
// using "-" sign
using System;
  
class GFG {
  
    // Function to reverse array
    static void reverseArray(int[] arr, int n)
    {
        // Trick to assign -1 to a variable
        int x = (int.MinValue / int.MaxValue);
  
        // Reverse array in simple manner
        for (int i = 0; i < n / 2; i++)
  
            // Swap ith index value with (n-i-1)th
            // index value
            swap(arr, i, n + (x * i) + x);
    }
  
    static int[] swap(int[] arr, int i, int j)
    {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
        return arr;
    }
  
    // Drivers code
    public static void Main()
    {
        int[] arr = { 5, 3, 7, 2, 1, 6 };
        int n = arr.Length;
  
        reverseArray(arr, n);
  
        // print the reversed array
        for (int i = 0; i < n; i++)
            Console.Write(arr[i] + " ");
    }
}
  
/* This code contributed by PrinciRaj1992 */
PHP



<?PHP
// PHP program to reverse an array without
// using "-" sign
  
// Function to reverse array
function reverseArray(&$arr, $n)
{
    // Trick to assign -1 to a variable
    $x = (PHP_INT_MIN / PHP_INT_MAX);
  
    // Reverse array in simple manner
    for ($i = 0; $i < $n / 2; $i++)
  
        // Swap ith index value with (n-i-1)th
        // index value
        swap($arr, $i, $n + ($x * $i) + $x);
}
  
function swap(&$arr, $i, $j)
{
    $temp = $arr[$i];
    $arr[$i] = $arr[$j];
    $arr[$j] = $temp;
    return $arr;
}
  
// Drivers code
$arr = array( 5, 3, 7, 2, 1, 6 );
$n = sizeof($arr);
  
reverseArray($arr, $n);
  
// print the reversed array
for ($i = 0; $i < $n; $i++)
    echo($arr[$i] . " ");
  
// This code is contributed by Code_Mech
Output:
6 1 2 7 3 5

Method 4:
In this method 4, the idea is to use bitwise operator to implement subtraction i.e.
A – B = A + ~B + 1
so, i– can be written as i = i +~1 +1
C++



// C++ program to reverse an array without
// using "-" sign
#include <bits/stdc++.h>
using namespace std;
  
// Function to reverse array
void reverseArray(int arr[], int n)
{
  
    // Reverse array in simple manner
    for (int i = 0; i < n / 2; i++)
  
        // Swap ith index value with (n-i-1)th
        // index value
        // Note : A - B = A + ~B + 1
        // So n - i = n + ~i + 1 then
        // n - i - 1 = (n + ~i + 1) + ~1 + 1
        swap(arr[i], arr[(n + ~i + 1) + ~1 + 1]);
}
  
// Driver code
int main()
{
    int arr[] = { 5, 3, 7, 2, 1, 6 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    reverseArray(arr, n);
  
    // print the reversed array
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
  
    return 0;
}
Java



// Java program to reverse an array without
// using "-" sign
import java.util.Arrays;
  
class GFG {
  
    // Function to reverse array
    static void reverseArray(int arr[], int n)
    {
     
        // Reverse array in simple manner
        for (int i = 0; i < n / 2; i++)
  
        // Swap ith index value with (n-i-1)th
        // index value
        // Note : A - B = A + ~B + 1
        // So n - i = n + ~i + 1 then
        // n - i - 1 = (n + ~i + 1) + ~1 + 1
        {
            swap(arr, i, (n + ~i + 1) + ~1 + 1);
        }
    }
  
    static int[] swap(int[] arr, int i, int j)
    {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
        return arr;
    }
  
    // Driver code
    public static void main(String args[])
    {
        int arr[] = { 5, 3, 7, 2, 1, 6 };
        int n = arr.length;
  
        reverseArray(arr, n);
  
        // print the reversed array
        for (int i = 0; i < n; i++) {
            System.out.print(arr[i] + " ");
        }
    }
}
  
// This code contributed by Rajput-Ji
Python3



# Python program to reverse an array without 
# using "-" sign 
  
# Function to reverse array 
def reverseArray(arr, n):
  
    # Reverse array in simple manner 
    for i in range(n//2): 
  
        # Swap ith index value with (n-i-1)th 
        # index value 
        # Note : A - B = A + ~B + 1 
        # So n - i = n + ~i + 1 then 
        # n - i - 1 = (n + ~i + 1) + ~1 + 1 
        arr[i], arr[(n + ~i + 1) + ~1 + 1] = arr[(n + ~i + 1) + ~1 + 1],arr[i]
  
# Driver code 
  
arr = [ 5, 3, 7, 2, 1, 6 ] 
n = len(arr)
  
reverseArray(arr, n)
  
# print the reversed array 
for i in range(n):
    print(arr[i],end=" ")
  
# This code is contributed by ankush_953
C#



// C# program to reverse an array without
// using "-" sign
using System;
  
class GFG {
  
    // Function to reverse array
    static void reverseArray(int[] arr, int n)
    {
  
        // Reverse array in simple manner
        for (int i = 0; i < n / 2; i++)
  
        // Swap ith index value with (n-i-1)th
        // index value
        // Note : A - B = A + ~B + 1
        // So n - i = n + ~i + 1 then
        // n - i - 1 = (n + ~i + 1) + ~1 + 1
        {
            swap(arr, i, (n + ~i + 1) + ~1 + 1);
        }
    }
  
    static int[] swap(int[] arr, int i, int j)
    {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
        return arr;
    }
  
    // Driver code
    public static void Main(String[] args)
    {
        int[] arr = { 5, 3, 7, 2, 1, 6 };
        int n = arr.Length;
  
        reverseArray(arr, n);
  
        // print the reversed array
        for (int i = 0; i < n; i++) {
            Console.Write(arr[i] + " ");
        }
    }
}
  
// This code has been contributed by 29AjayKumar
PHP



<?PHP
    // PHP program to reverse an array without
    // using "-" sign
      
    // Function to reverse array
    function reverseArray(&$arr, $n)
    {
  
        // Reverse array in simple manner
        for ($i = 0; $i < $n / 2; $i++)
  
        // Swap ith index value with (n-i-1)th
        // index value
        // Note : A - B = A + ~B + 1
        // So n - i = n + ~i + 1 then
        // n - i - 1 = (n + ~i + 1) + 1 + 1
        {
            swap($arr, $i, ($n + ~$i + 1) + ~1 + 1);
        }
    }
  
    function swap(&$arr, $i, $j)
    {
        $temp = $arr[$i];
        $arr[$i] = $arr[$j];
        $arr[$j] = $temp;
        return $arr;
    }
  
    // Driver code
    {
        $arr = array( 5, 3, 7, 2, 1, 6 );
        $n = sizeof($arr);
  
        reverseArray($arr, $n);
  
        // print the reversed array
        for ($i = 0; $i < $n; $i++)
        {
            echo($arr[$i] . " ");
        }
    }
  
// This code contributed by Code_Mech
Output:
6 1 2 7 3 5

This article is contributed by Sahil Chhabra. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
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.
My Personal Notes
arrow_drop_up
Previous
Flow control in try catch finally in Java
Next

Check if product of every pair exists in an array
Recommended Articles
Page :
Subtract two numbers without using arithmetic operators
29, Mar 15
Subtract 1 without arithmetic operators
05, Jun 18
Smallest string without any multiplication sign that represents the product of two given numbers
10, Sep 20
Minimum number of subtract operation to make an array decreasing
21, Dec 17
Count ways to split array into two equal sum subarrays by changing sign of any one array element
03, Dec 20
Count of unique pairs (i, j) in an array such that sum of A[i] and reverse of A[j] is equal to sum of reverse of A[i] and A[j]
12, Feb 21
Maximize sum of an Array by flipping sign of all elements of a single subarray
01, Sep 20
Print all the combinations of N elements by changing sign such that their sum is divisible by M
07, Aug 18
Flipping Sign Problem | Lazy Propagation Segment Tree
02, Jul 19
Maximum length Subsequence with alternating sign and maximum Sum
22, Apr 20
Maximum sum possible by assigning alternate positive and negative sign to elements in a subsequence
20, Oct 20
Reverse a string without affecting special characters
27, Oct 15
Sort an array using Bubble Sort without using loops
04, Mar 21
Program to reverse an array using pointers
18, Dec 17
Reverse an array using Stack
17, Jan 21
First string from the given array whose reverse is also present in the same array
12, Mar 19
Sort an array where a subarray of a sorted array is in reverse order
24, Jul 18
Largest in array without using conditionals / bitwise / ternary operators
12, Nov 17
Find minimum in an array without using Relational Operators
20, Nov 17
Find maximum in an array without using Relational Operators
21, Nov 17
Find largest element from array without using conditional operator
04, Dec 17
Printing all subsets of {1,2,3,...n} without using array or loop
30, Oct 18
How to print an Array in Java without using Loop
26, Aug 19
Maximum OR value of a pair in an Array without using OR operator
08, May 20
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