Register

Can Merge Sort Time Complexity be O(n^2) in any condition?

1,336 views
1 votes
1 votes
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Akriti sood asked Dec 27, 2016
368 views
How many levels are present for this algorithm assuming merge can be accomplished in O(n log(k)) time.
in an effort to make MERGE-SORT faster, you decide to divide the array into k equal sized, disjoint subarrays, where k 2. This means that you have to merge k lists. How ...
User Avatar
8 votes
8 votes
2 answers
3
radha gogia asked Jul 19, 2015
20,226 views
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
(A) Insertion Sort with time complexity O(kn)(B) Heap Sort with time complexity O(nLogk)(C) Quick Sort with time complexity O(kLogk)(D) Merge Sort with time complexity O(...
User Avatar
1 votes
1 votes
3 answers
4
Angkit asked Apr 23, 2017
14,530 views
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ? A)mergesort B)quicksort C)radixsort D)insertionsort E)heapsort
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?A)mergesortB)quicksortC)radixsortD)insertionsortE)heapsort
User Avatar
Link Copied!