4 votes 4 votes Which of the following sorting algorithms does not have a worst case running time of $O(n^2)$? Insertion sort. Merge sort. Quick sort. Bubble sort. Algorithms nielit2016mar-scientistb algorithms sorting time-complexity + – admin asked Mar 31, 2020 • retagged Oct 20, 2020 by Krithiga2101 admin 15.7k views answer comment Share Follow See 1 comment See all 1 1 comment reply vg653 commented Mar 31, 2020 reply Follow Share Merge sort. 1 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes Merge sort - nlogn Quick sort - n*n Bubble sort - n*n insertion sort - n*n Answer is merge sort HiteshVaish answered Apr 2, 2020 HiteshVaish comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option B will be the correct option merge sort - O(nlogn) insertion sort - O(n^2) quick sort - O(n^2) bubble sort - O(n^2) These all are worst case time complexities of these algorithms Vipin Tiwari answered Apr 4, 2020 Vipin Tiwari comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Yes..Merge sort has the time complexity of O ( n log n). Hence option B is correct. DIBAKAR MAJEE answered Apr 24, 2020 DIBAKAR MAJEE comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Merge sort -O(nlogn) ptarafdar010 answered Apr 28, 2020 ptarafdar010 comment Share Follow See 1 comment See all 1 1 comment reply Roshini commented May 12, 2020 reply Follow Share Yes it's merge sort with Tc o(nlogn) rest of them have time complexity as o(n^2). 0 votes 0 votes Please log in or register to add a comment.