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

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

Question Posted / zeeshan

Answer Posted / zeeshan

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

Is This Answer Correct ?

2 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Write the stack overflow condition.

1031

What is different between array and list?

915

Is array immutable?

890

Is linkedlist thread safe?

859

write an algorithm to show the procedure of insertion into a b-tree?

925

Which is faster treemap or hashmap?

889

What is the height of binary tree?

978

Does arraylist have a tostring?

868

Tell me the difference between structure and array?

966

What is the difference between arraylist and linkedlist?

980

How do you find a string is anagram or not?

904

What do you mean by disjoint set adt?

971

Can arraylist be resized?

986

What is the difference between data type and data structure?

862

Differentiate between hashset and treeset.

990