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.
Who first proved that all comparison-based sorting is at least Omega(n lg n)?
Is there a name attached to this lower-bound? e.g. The SomeGuysLastName Theorem?
My copy of ‘Introduction to Algorithms’ has this to say in the chapter notes for chapter 8, which is where this bound is discussed:
Not a defininite answer to your question, but it’s something.