-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathAssignment 2 - Question3.java
More file actions
59 lines (52 loc) · 1.32 KB
/
Copy pathAssignment 2 - Question3.java
File metadata and controls
59 lines (52 loc) · 1.32 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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
import java.util.*;
public class solution{
public static int strCompare(String string1,
String string2)
{
for (int i = 0; i < string1.length() &&
i < string2.length(); i++) {
if ((int)string1.charAt(i) ==
(int)string2.charAt(i)) {
continue;
}
else {
return (int)string1.charAt(i) -
(int)string2.charAt(i);
}
}
if (string1.length() < string2.length()) {
return (str1.length()-str2.length());
}
else if (string1.length() > string2.length()) {
return (string1.length()-string2.length());
}
else {
return 0;
}
}
public static void main(String[] args){
Scanner sc = new Scanner ( System.in ) ;
System.out.println("Enter the size of array");
int n = sc.nextInt();
n=n+1;
String[] arr = new String[n];
System.out.println("Enter the elements : ");
for(int i = 0 ; i < n ; i++ ) {
arr[i] = sc.nextLine();
}
for(int i = 0 ; i < n ; i++ ) {
for(int j = i+1 ; j < n ; j++ ) {
if(strCompare(arr[i],arr[j]) > 0) {
String t=arr[j];
arr[j]=arr[i];
arr[i]=t;
}
else
continue;
}
}
for(int i=0;i<n;i++) {
System.out.println(arr[i] + " ");
}
}
}