0 votes 0 votes Which of the following sorting algorithms has/have minimum running time complexity in best case? I. Selection Sort II. Insertion Sort a. I b. II c. Both have same minimum running time complexity Algorithms algorithms sorting time-complexity + – sh!va asked Feb 15, 2017 • retagged Jun 24, 2022 by makhdoom ghaya sh!va 3.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Insertion sort has minimum running time complexity O(n) in best case i.e when the array is already sorted. Worst case time complexity of insertion sort =O($n^{2}$ )and selection sort is also O($n^{2}$) Ans:B) Arnabi answered Feb 15, 2017 Arnabi comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes B insertion sort ashish615 answered Feb 15, 2017 ashish615 comment Share Follow See all 0 reply Please log in or register to add a comment.