import java.util.ArrayList;
import java.util.Collections;
public class NaturalSortingExample {
public static void main(String[] args) {
ArrayList<Integer> numbers = new ArrayList<>();
numbers.add(5);
numbers.add(2);
numbers.add(10);
numbers.add(1);
Collections.sort(numbers);
for (int number : numbers) {
System.out.println(number);
}
}
}
1
2
5
10
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
public class CustomSortingExample {
public static void main(String[] args) {
ArrayList<String> names = new ArrayList<>();
names.add("John");
names.add("Alice");
names.add("Bob");
names.add("David");
Collections.sort(names, new LengthComparator());
for (String name : names) {
System.out.println(name);
}
}
}
class LengthComparator implements Comparator<String> {
@Override
public int compare(String s1, String s2) {
return s1.length() - s2.length();
}
}
Bob
John
Alice
David
