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 heard that it’s possible with some divide and conquer algorithm to check if an array is sorted in Log(N). The fastest way I know is O(N) (just running through the list and checking if element is greater than previous).
I looked online and couldn’t find anything, but I thought to ask here if anyone knew before giving up.
To check if an array is sorted with no previous knowledge, you need to look at all elements at least once, so O(n) is the minimum.