Hi, Given a list, list1 having 100,000 non repeating, sorted integers , which of the following methods is fastest to find an item fully understanding the item may or may not be in the list: The binary search method which is the standard search for such a small sample size, or the more python type statement is <value> in list1?
What I am really trying to ascertain is how expensive or how efficient is 'is <value> in list1'. Thanks for your input Robert Berman What you don't see with your eyes, don't invent with your mouth. _______________________________________________ Tutor maillist - Tutor@python.org To unsubscribe or change subscription options: http://mail.python.org/mailman/listinfo/tutor
