Bubble Sort cannot be the answer, Because the MODIFIED BUBBLE SORT takes co

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

Question Posted / rahul

Answer Posted / rahul

Bubble Sort cannot be the answer, Because the MODIFIED BUBBLE SORT takes complexity of O(n) when the elements are arranged in a particular order..

Is This Answer Correct ?

1 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Explain the implementation of an AVL tree and Binary tree.

936

Is null a binary search tree?

839

What is the use of space complexity and time complexity?

1034

What is the advantage of circular linked list?

808

What is the use of isEmpty() member methods?

971

How does insertion sort works?

864

what is a balanced tree.

977

What is a vector class?

857

Does arraylist guarantee insertion order?

899

Is hashmap a data structure?

987

Is list a data structure?

951

Can binary tree have 1 child?

884

Does treemap preserve order?

838

Write a Program for Reverse a linked list.

935

What are AVL trees?

1048