Answer / megha

package practise;

import java.util.Scanner;

class Sorting {
public static void main(String[] input)
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the count :\t ");
int k=sc.nextInt();
String temp=new String();
String names[]=new String[k];
System.out.println("enter the names");
for(int i=0;i<k;i++)
{
names[i] = sc.next();
}
for( int i=0;i<k;i++)
{
for(int j =i+1;j<k;j++)
{
if(names[i].compareTo(names[j])>0)
{
temp = names[i];
names[i] = names[j];
names[j] = temp;
}
}
}
for(String name:names)
{
System.out.println(name);
}
}
}

Difference between comparator and comparable in java?

0 Answers  

---

What is json parser in java?

0 Answers  

---

How are this and super used?

7 Answers   IBM,

---

Does constructor be static?

0 Answers  

---

What is busy spin, and why should you use it?

0 Answers  

---

what is recursion in java

0 Answers   Cap Gemini,

---

JVM responsibility?

6 Answers   TCS,

---

Which of the following is not an isolation level in the JDBC

0 Answers   CTS,

---

What is array command?

0 Answers  

---

what is difference between equals and ==?

0 Answers  

---

Compare Mutex and Semaphore in java.

0 Answers   Ciena,

---

What lambda means?

0 Answers  

---