searching_concepts

This site requires JavaScript. It looks like you have disabled JavaScript in your browser or are using a browser that does not support JavaScript. Please enable it or try another browser.

Main Page → Exercises → Python → Solve an Exercise

Need help?

Stuck on an exercise? Contact your TA or instructor.

Is there a problem? Contact us.

What are ways to search an unsorted list of strings using the Python class libraries? (Check all that apply.)
Perform a sequential search over the list using a loop. It cannot be done. Convert the strings to integers first, then search them. Sort the list using sort() and then perform a binary search over it using bisect.bisect_left(). Write the list to a file so that it will be searchable. (order shuffled)
If you perform a binary search on a list of one million integers, which of the following is closest to the number of elements that the search algorithm will need to examine?
all 1,000,000 of the integers roughly 3/4 (750,000) of the integers roughly half (500,000) of the integers roughly 1/10 (100,000) less than 1% (10,000 or fewer)
Should you use a sequential or binary search on a list of strings, and why?
Sequential search should always be used because it is faster. Binary search should be used as long as the strings are all in lowercase so they can be compared. Use binary search if the list is sorted; otherwise you must use sequential search. Use binary search on unsorted lists, and sequential search on sorted lists. (order shuffled)
Why does the binary search algorithm require the input to be sorted?
Because it uses the ordering to jump to the next index, so if the elements are out of order, the search won't find the target element. Because all searching requires sorted input. Because a list is not a valid collection to search; instead a different collection should be used that forces sorting. Because of a bug in the Python standard libraries. Sorted lists are easier to search because the searching algorithm only needs to look at the first element to see if the target value will be present. (order shuffled)
How many elements at most does a binary search examine if the list contains 60 elements?
1 3 6 10 15 30 60

CodeStepByStep

Ad Blocker Detected