forked from 14visheshjain/DataStructure-Algorithm-in-java
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathReerseInArray.java
More file actions
34 lines (31 loc) · 714 Bytes
/
ReerseInArray.java
File metadata and controls
34 lines (31 loc) · 714 Bytes
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
package lecture4;
import java.util.Scanner ;
public class ReerseInArray {
static Scanner s = new Scanner(System.in);
public static void main(String[] args) {
int[] arr = takeinput();
reverse(arr);
display(arr);
}
public static int[] takeinput() {
System.out.println("size?");
int n = s.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = s.nextInt();
}
return arr;
}
public static void reverse(int[] arr) {
for(int i=0 ; i<= (arr.length-1)/2 ; i++ ) {
int temp=arr[i];
arr[i]=arr[arr.length - i -1] ;
arr[arr.length - i -1]=temp;
}
}
public static void display(int[] a) {
for (int val : a) {
System.out.println(val);
}
}
}