Advertising
- Anonymous
- Saturday, May 12th, 2012 at 9:08:42am MDT
- def bisearch(s,e,first,last):
- print(first,last)
- if(last-first)<2:return s[first]==e or s[last]==e
- mid=first+(last-first)/2
- if s[mid]==e:return True
- if s[mid]>e:return bisearch(s,e,first,mid-1)
- return bisearch(s,e,mid+1,last)
- def search1(s,e):
- print(bisearch(s,e,0,len(s)-1))
- print ("search complete")
- def testsearch():
- s=range(0,1000001)
- input("binary,-1")
- print(search1(s,-1))
- input("binary,end")
- print(search1(s,1000000))
advertising
Update the Post
Either update this post and resubmit it with changes, or make a new post.
You may also comment on this post.
Please note that information posted here will expire by default in one month. If you do not want it to expire, please set the expiry time above. If it is set to expire, web search engines will not be allowed to index it prior to it expiring. Items that are not marked to expire will be indexable by search engines. Be careful with your passwords. All illegal activities will be reported and any information will be handed over to the authorities, so be good.