Computer Science, asked by shezaahmed1300, 1 year ago

What would be the worst case time complexity of the insertion sort algorithm if the inputs are restricted to permutation of N with at most n inversions?

Answers

Answered by Anonymous

Insertion sort is stable, online but not suited well for large number of elements.

B

Insertion sort is unstable and online

C

Insertion sort is online and can be applied to more than 100 elements

D

Insertion sort is stable & online and can be applied to more than

Previous Question

Next Question

Similar questions

English, 6 months ago

1. Subira turned her head and gazed at the crowd. Who is Subira? Where did this incident happen? 2. Though the boy was very rude, Tippi did not react. Why do you think she was so calm? 3. Why had Cory become so bitter and angry? Do you think this was a natural outcome of his unfortunate experience? plzzz give me answers 4. Subira decided to give the audience a show of her skills. What did...

Biology, 6 months ago

start codon and stop codon is?

Social Sciences, 6 months ago

1. What are the causes of soil erosion?

Computer Science, 1 year ago

When you drag a picture into notepad you can see lots of different characters why is it not in binary and how can you see or open a picture in binary?

Computer Science, 1 year ago

Prime minister who apologized for the treatment of the man who gave his name to the famous test for artificial intelligence?

Math, 1 year ago

m square-5m=-3 can anybody...

Social Sciences, 1 year ago

Difference between hard disk and pen drive...

Science, 1 year ago

Difference between frame and keyframe in flash...