This preview shows pages 1–3. 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: 6. The _________ is adequate for searching through small arrays. A. binary search B. linear search C. unary search D. bubble sort E. None of these 7. ___________ algorithms are used to arrange random data into some order. General Page 2 A. Standard search B. Linear C. Sorting D. Binary search E. None of these 8. True/False: Before you can perform a selection sort, the data must be stored in ascending order. A. True B. False 9. True/False: Before you can perform a bubble sort, the data must be stored in descending order. A. True B. False 10. True/False: Using a binary search, you are more likely to find an item than if you use a linear search. A. True B. False &gt; General Page 3...
View Full Document
This note was uploaded on 02/24/2011 for the course CS 245 taught by Professor Duke during the Fall '10 term at VCU.
- Fall '10