I can't find the solution for this simple but tricky issue I'm facing Right now in Java 1D Array Sorting

I started doing a revision of Java Arrays and decided to start with sorting. Please go through my code. After sorting I can't compare the Original Array and the sorted array. The result always drops true as result.

//Code Begins---
import java.util.*;
public class Array_Sorting {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the Range of the array: ");
        int n = sc.nextInt();
        int arr[] = new int[n];
        System.out.println("Enter the array elements: ");
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        System.out.println("1- Print the Current Array \n2. Print the sorted Array");
        int x = sc.nextInt();
        switch (x) {
            case 1:
                System.out.println("The array elements are: \n");
                for (int i = 0; i < n; i++) {
            case 2:
                int brr[] = arr;
                if (Arrays.equals(arr,brr) { //here lies the problem I guess but I don't know how to fix it
                    System.out.println("The array elements are already in sorted sequence.");
                } else {
                    System.out.println("The sorted array elements are: \n");
                    for (int i = 0; i < n; i++) {
                System.out.println("Wrong Input");
}//Code Ends---
How many English words
do you know?
Test your English vocabulary size, and measure
how many words do you know
Online Test
Powered by Examplum