Difference between revisions of "More With Arrays Review Questions and Exercises"
From CompSciWiki
(→Review Questions) |
|||
| Line 15: | Line 15: | ||
===Sorting Arrays=== | ===Sorting Arrays=== | ||
| − | ===Parallel Arrays=== | + | ===<div id="parallel arrays q">Parallel Arrays</div>=== |
| + | #How are parallel arrays tied together? | ||
| + | #When sorting a parallel array, should you use the same method as for a regular array? | ||
| + | |||
| + | [[More with Arrays Solutions#parallel arrays sol|Solutions]] | ||
==Exercises== | ==Exercises== | ||
Revision as of 16:56, 3 December 2007
COMP 1010 Home > More With Arrays > Review Questions and Exercises
{{{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
- How are parallel arrays tied together?
- When sorting a parallel array, should you use the same method as for a regular array?
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.)
