This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ---> True False Binary search always be faster than linear search, even on a large data set. ---> True False For example, if the item being searched for is the first item in the list, the linear search will find it on its first look, while binary search will take the maximum number of looks, logn . The best-case time complexity of binary search is in O(1). ---> True False On average, the linear search algorithm will have to compare the search key with half of the elements in the array. ---> True False A complete binary tree has a natural representation in an array. ---> True False The worst-case time complexity of binary search is in O(log n). ---> True False A B C D F E G...
View Full Document
This note was uploaded on 05/25/2010 for the course CPE CPE 360 taught by Professor Jenniferchen during the Spring '10 term at Stevens.
- Spring '10