insertion sort works efficiently on sorted lists.....

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

Question Posted / varma

Answer Posted / varma

Is This Answer Correct ?

2 Yes

1 No

Please Help Members By Posting Answers For Below Questions

What is the use of substring?

1004

Can a null element added to a treeset or hashset?

917

Mention for which header list, you will found the last node contains the null pointer?

900

Write the postfix form of the expression: (a + b) * (c - d)

1096

What do you mean by hash function?

978

Is data structures and algorithms important?

986

In which matrix, we can use multilinked structures?

950

Which is faster hashmap or treemap?

949

What is the advantage of circular linked list?

867

How can you insert a node at the end of linked list?

925

What does adt stands for?

926

What is the use of bubble sort?

925

Is bucket sort stable?

920

Can arraylist be null?

954

Does hashmap allow null keys?

929