Register

Which sorting has poorest/ largest best case complexity?

525 views

2 Answers

0 votes
0 votes
selection sort and bubble sort have largest best case complexity.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
sh!va asked Jun 16, 2016
900 views
Is tightest upper bound equivalent to best case complexity
In gate 2003 cse question, i read that tightest upper bound of selection sort is O(n), which occurs only when ( n-1) swaps. My doubt is " tightest upper bound " is kuust another name of best case complexity?
In gate 2003 cse question, i read that tightest upper bound of selection sort is O(n), which occurs only when ( n-1) swaps. My doubt is " tightest upper bound " is kuust ...
User Avatar
0 votes
0 votes
1 answer
2
Sanjay Sharma asked Jun 8, 2016
4,939 views
Which algorithm has same average, worst case and best case time
Which algorithm has same average, worst case and best case time ? Binary search Maximum of n number Quick sort Fibonacci search
Which algorithm has same average, worst case and best case time ?Binary searchMaximum of n numberQuick sortFibonacci search
User Avatar
8 votes
8 votes
2 answers
3
radha gogia asked Jul 19, 2015
20,236 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
Link Copied!