Answer Posted / nitesh

Right now two ways come to my mind.

First:
Create a TreeSet, add all the dates to it. They get
sorted by default since java.util.Date implements
comparable. Here is an example -->
Set<Date> sortedDates = new TreeSet<Date>();
sortedDates.add(new Date());
Calendar cal = Calendar.getInstance();
cal.set(2009, 2, 12);
sortedDates.add(cal.getTime());

Second:
We can use the compare method inside Date class
directly and write our own sorting implementation.

What are the advantages of java inner classes?

1012

---

Does unicode support all languages?

959

---

what is collatration?

3230

---

How to optimize the javac output?

959

---

What is append function?

941

---

What is static variable with example?

951

---

What are default methods ?

981

---

What is lambda in java?

977

---

What is a vector in java?

971

---

What is the program development process?

924

---

What is hashset in java?

1055

---

Does java support multiple inheritances?

965

---

Give us a program to check for parenthesis matching using stack.

947

---

Are arrays static in java?

1002

---

What is the difference between jfc & wfc?

1012

---