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

Explain the Stack

909

What is the minimum number of nodes that a binary tree can have?

1088

What do you mean by breadth first search (bfs)?

933

Does treemap allow null keys?

875

What is the non linear data structure?

866

Difference between calloc and malloc in data structures?

849

Can we increase the size of statically allocated array?

836

Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?

859

What is dynamic array how it is created?

852

What do you know about the big-o notation and can you give some examples with respect to different data structures?

868

Why do we need to use computers to help us sort lists?

866

What sort does arrays sort use?

820

Can a stack be described as a pointer? Explain.

854

What is a list of lists?

878

What are arrays give example?

854