0 votes 0 votes The tightest lower bound on the number of comparisons, in worst case for comparison based sorting is of the order of ? (A)$n$ (B)$n^2$ (C)$nlogn$ (D)$n \space{log\space n}^2$ Algorithms ace-test-series algorithms sorting + – Ayush Upadhyaya asked Mar 8, 2017 • edited Mar 7, 2019 by Rishi yadav Ayush Upadhyaya 631 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes quick sort merge sort selection sort insertion sort heap sort worst case O($n^{2}$) $O(nlogn)$ O($n^{2}$) O($n^{2}$) O(nlogn) so, tightest lower bound is O(nlogn) 2018 answered Mar 8, 2017 2018 comment Share Follow See all 0 reply Please log in or register to add a comment.