Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
While going through Wikipedia’s list of sorting algorithms I noticed that there’s no stable comparison sort that has O(n*log(n)) (worst-case) time-complexity and O(1) (worst-case) space-complexity. This surely looks like a theoretical boundary, but I couldn’t find more information about it.
How would one proof this?
Note: I know about the lower limit of O(n*log(n)) worst-case time-complexity for comparison sorts.
Despite what that article says, in-place stable Merge Sort can be made
O(n log n).Here is a paper that explains two ways to implement it.