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.
I have two algorithms with time complexities of O(n log n) and O(n log3 n).
Which of these algorithms is more efficient? for example this case, as they seem so close? Or am I right in thinking that in terms of complexity they are equal as they are the same rate of growth?
O(n log n) and O(n log3 n) are the same thing.