Write an algorithm for quick sort?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Core Java Interview Questions

abstract class A{ int list []=new int [100]; A(int x,int y){ rondom n=new rondom(); for (int i==;i<100;i++); list [i]=x+r.next int(y-x+1); abstract sort (); abstract binary sarch(int temp); class B extends A{

3 Answers  


What is compareto?

0 Answers  


How does regex work?

0 Answers  


Is Cegonsoft Pvt.Ltd. a good Institute?

4 Answers  


How do you break a loop?

0 Answers  






If system.exit (0); is written at the end of the try block, will the finally block still execute?

0 Answers  


Why we go for collections in java?

0 Answers  


what is main difference between architecture,framework and design pattren

3 Answers  


What are the names of interfaces that doesn't consists of method/s ?

3 Answers  


What is the difference between keyword and identifier?

0 Answers  


Why super is first line in java?

0 Answers  


Can this keyword be used to refer static members?

0 Answers  


Categories