-
Notifications
You must be signed in to change notification settings - Fork 153
/
Copy pathReverse.java
54 lines (45 loc) · 1.37 KB
/
Reverse.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/**
* Reverse Array
* @author MadhavBahl
* @date 26/01/2019
*/
import java.util.Scanner;
public class Reverse {
public static void inputArr (int arr[], int num) {
Scanner input = new Scanner(System.in);
System.out.println("Enter the elements: ");
for (int i=0; i<num; i++) {
System.out.print("arr[" + i + "] = ");
arr[i] = input.nextInt();
}
}
public static void printArr (int arr[], int num) {
for (int i=0; i<num; i++)
System.out.print(arr[i] + " ");
}
public static void reverse (int arr[], int num) {
int temp;
for (int i=0; i<=num/2; i++) {
temp = arr[i];
arr[i] = arr[num-i-1];
arr[num-i-1] = temp;
}
}
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("/* ===== bubble Sort ===== */");
// Input the array
System.out.print("\nEnter the number of elements in the array: ");
int num = input.nextInt();
int arr[] = new int[num];
inputArr(arr, num);
// Print the array
System.out.print("\nOriginal Array: ");
printArr(arr, num);
// Reverse the array
reverse(arr, num);
// Print the array
System.out.print("\n\nReversed Array: ");
printArr(arr, num);
}
}