A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?

Answer Posted / zeeshan

insertion sort shows best case behaviour when list is
already sorted.....

Is This Answer Correct ?    2 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Does arraylist guarantee insertion order?

505


What is sorting explain?

489


What is stable sort?

520


What do you mean by sorting data?

492


What are the best data structure courses for gate preparation?

502






What is difference between hashmap and arraylist?

519


what is the primary advantage of a linked list?

948


Is collection a class or interface?

510


How can you represent a linked list node?

554


How does the bubble sort work?

504


Which is the parent class of linkedhashset class?

525


What is the order of selection sort?

459


What is sorted list in data structure?

494


What is meant by heap sort?

500


Explain what are the major data structures used in the hierarchical data model?

541