-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathZadatak5.java
More file actions
35 lines (33 loc) · 1.01 KB
/
Zadatak5.java
File metadata and controls
35 lines (33 loc) · 1.01 KB
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
import java.util.Arrays;
import java.util.Scanner;
public class Zadatak5 {
public static void main(String[] args) {
Scanner ulaz = new Scanner(System.in);
int duzinaNiza = ulaz.nextInt();
int[] niz = new int[duzinaNiza];
int clan;
for (int i=0; i < niz.length; i++) {
clan = ulaz.nextInt();
niz[i] = clan;
} ;
Arrays.sort(niz);
int x = ulaz.nextInt();
// Without using Arrays for finding element
// for (int value : niz) {
// if (value == x) {
// System.out.println("It exists!");
// }
// ;
// };
System.out.println(x +" is" + Arrays.binarySearch(niz, x));
if (duzinaNiza <= 5){
for (int i =0; i < niz.length; i++){
System.out.println(niz[i]);
}
} else {
for (int i = 0; i < 5; i++) {
System.out.println(niz[i]);
}
}
}
}