Difference between revisions of "More With Arrays Review Questions and Exercises"
From CompSciWiki
(→Searching Arrays) |
(→Apply the binary search) |
||
| Line 16: | Line 16: | ||
==Exercises== | ==Exercises== | ||
| − | ===Apply the binary search=== | + | ===<div id="searching arrays e">Apply the binary search</div>=== |
Modify the [[Searching Arrays#binary search algorithm|binarySearch()]] algorithm to keep count of how many elements the algorithm checks to find the desired element. Print out each checked element's value (in other words, the value compared with the search value.) | Modify the [[Searching Arrays#binary search algorithm|binarySearch()]] algorithm to keep count of how many elements the algorithm checks to find the desired element. Print out each checked element's value (in other words, the value compared with the search value.) | ||
Revision as of 13:55, 30 November 2007
COMP 1010 Home > Selection Search Algorithm
{{{Body}}}
Review Questions
Passing Arrays using Methods
Working with Paritally Filled Arrays
Arrays of Strings
Searching Arrays
- Does the array have to be sorted to use a linear search?
- Does the array have to be sorted to use a binary search?
- Which algorithm is more efficient: linear search, or binary search?
- Referring to the "phone book" example, which search algorithm uses the "cut the phone book in half" method - linear or binary search?
Sorting Arrays
Parallel Arrays
Exercises
Apply the binary search
Modify the binarySearch() algorithm to keep count of how many elements the algorithm checks to find the desired element. Print out each checked element's value (in other words, the value compared with the search value.)
