[algogeeks] Re: Sorted array or not bentley

Sun, 02 Jul 2006 23:29:42 -0700

Please be complete with your question. Most of this group readers will not be having the book. so please do explain whatever is stated about the partial checking in that book.
 
regards
Arunachalam.

 
On 7/2/06, Terry <[EMAIL PROTECTED]> wrote:

hi,
this is regarding a problem from programming pearls by jon bentley
column 5.
I have few questions ,
1) how to check if an array is sorted or not.  Can it be done it sub -
linear time

2) In section 5.8 problem 5, he describes saying that checking a  array
is sorted or not takes n-1 operations. How can you add partial checking
to the function at significantly less cost.

I understand the n-1 part doing a
for(i=0;i<n-1;i++)
if(arr[i] > arr[i+1]
return 0;

but i don't get the partial checking part.



http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to