Discussion Outline- Week 13

1. General Questions
   • Questions on Hangman (still)
   • Return remaining Quiz 2s
2. Arrays
   • Internal representation of an array
   • Name of the array is a variable that holds the base address
   • Each element has an index beginning with 0
   • Access beyond the end of the array is allowed, causes BIG problems
   • How to pass arrays to functions
     • Show syntax of prototype and call
     • Function modifies original because address was passed
     • Nothing need be returned
3. Sorting
   • Many sorting algorithms - Name some
   • Selection Sort was discussed in class either review it
   • OR Show them Insertion Sort
4. Searching
   • Items must already be sorted
   • Explain linear search - stress amount of time needed
   • Explain binary search - discuss speed