0 votes 0 votes What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements . I know that the best sorting algorithm is no better than O(n log n).Please answer in terms of the asymptotic notation. Algorithms sorting algorithms discrete-mathematics + – argha1992 asked Oct 27, 2018 recategorized Jul 6, 2022 by Lakshman Bhaiya argha1992 554 views answer comment Share Follow See 1 comment See all 1 1 comment reply pradeepchaudhary commented Nov 1, 2018 reply Follow Share In this Line 2^n^2 elements what is n Here? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I think: For comparison based algorithms: O($n^{2}2^{n^{2}}$) And for non-comparison based algorithm, if the numbers are in fixed range or the largest number is not a big number such that the number of digits doesn't depend on n: O($2^{n^{2}}$) reboot answered Jan 5, 2021 reboot comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I we use merge sort as the algorithm(which is best for worst case) then, The time complexity T(n) = n^2* 2^n^2 DAWID15 answered Dec 21, 2021 DAWID15 comment Share Follow See all 0 reply Please log in or register to add a comment.