/
1.sort_frames.java
59 lines (48 loc) · 1.5 KB
/
1.sort_frames.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
55
56
57
58
59
/*Write a program to sort frames using appropriate sorting techniques*/
import java.util.*;
public class sort1 {
public static void main(String[] args) {
List<int[]> frame = new ArrayList<>();
System.out.println("Enter no. of frames:");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
Random random = new Random();
int seqNum = random.nextInt(1000) + 1;
System.out.printf("Enter data for %dth frame>>", i + 1);
int data = sc.nextInt();
frame.add(new int[]{seqNum, data});
}
System.out.println("\n\nBefore Sorting>>");
for (int[] i : frame) {
System.out.printf("seqNum->%d, Data->%d\n", i[0], i[1]);
}
frame = sortFrame(frame);
System.out.println("\n\n After sorting>>");
for (int[] i : frame) {
System.out.printf("seqNum->%d, Data->%d\n", i[0], i[1]);
}
}
public static List<int[]> sortFrame(List<int[]> frame) {
Collections.sort(frame, (a, b) -> Integer.compare(a[0], b[0]));
return frame;
}
}
/*output
Enter no. of frames:
4
Enter data for 1th frame>>342
Enter data for 2th frame>>256
Enter data for 3th frame>>890
Enter data for 4th frame>>356
Before Sorting>>
seqNum->703, Data->342
seqNum->654, Data->256
seqNum->704, Data->890
seqNum->876, Data->356
After sorting>>
seqNum->654, Data->256
seqNum->703, Data->342
seqNum->704, Data->890
seqNum->876, Data->356
*/