2 votes 2 votes Which of the following sorting algorithms has the minimum running time complexity in the best and average case? Insertion sort, Quick sort Quick sort, Quick sort Quick sort, Insertion sort Insertion sort, Insertion sort Algorithms isro2013 sorting + – makhdoom ghaya asked Apr 26, 2016 makhdoom ghaya 5.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes Insertion sort best case O(n) Quick sort avg case O(n log n) Ans (A) srestha answered Apr 26, 2016 • selected Apr 27, 2016 by Arjun srestha comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Insertion sort (n) , Quick sort( n logn) Quick sort (n logn), Quick sort(n logn) Quick sort (n logn)), Insertion sort(n2) Insertion sort (n), Insertion sort(n2) Prashant. answered Apr 28, 2016 • edited Jul 1, 2016 by Prashant. Prashant. comment Share Follow See all 2 Comments See all 2 2 Comments reply shikha rathore commented Jul 1, 2016 reply Follow Share In bestcase Quick sort takes nlogn bt in option c u hv writtten Quick sort(n) ?? 0 votes 0 votes Prashant. commented Jul 1, 2016 reply Follow Share updated 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes Best Case Average Case Insertion Sort O(n) O(n^2) Quick Sort O(nlogn) O(nlogn) --------------------- ----------------------- =>Minimum O(n) O(nlogn) =================>Insertion Sort , Quick Sort So (A) is correct gshivam63 answered Jul 1, 2016 gshivam63 comment Share Follow See all 0 reply Please log in or register to add a comment.