Quiz · Final project · lesson 5 of 8Quiz — binary searchHow does binary search work, and what does it require?[A]Binary search works on unsorted data equally well: it picks the middle item regardless of any order, and because halving the range always ends, the list never needs to be sorted before you start searching.[B]Binary search takes as many steps as there are items, because in the worst case it still compares the target with every single item of the list, one by one, and it needs no particular order of the items.[C]Binary search compares the target with the first and the last item, then moves both ends one step inward each time, meeting in the middle after checking about half of the items; the list only has to be free of duplicate values.[D]Binary search halves a sorted list: compare the middle item to the target, drop the half that cannot hold it, repeat — about 20 steps for a million items. The list must be sorted first, or the dropped half may hold the target.Subscribe to take the courseThe course is free. Sign in with Telegram and subscribe to the channel to open every lesson.Continue with TelegramSign in another way← BackBinary searchNext →Exercise: binary search
