Session A2: Searching

In this laboratory session, you will investigate a number of algorithms for searching; that is, finding an element in a collection. Search is one of the most basic and most instructive introductory problems in computer science. The goals of this laboratory session are to:

• introduce the problem of searching;
• consider a more general sequence class as an alternative to arrays;
• learn about random sequence generation;
• investigate variations on the problem of searching;
• consider sequential search, one of the most basic searching algorithms; and
• consider binary search, an improved algorithm that only works on lists in which the elements are sorted.

Prerequisite skills:

• Objects, classes, and methods
• Arrays
• Loops
• Recursion

Required files:

• NumberGame.java
• NumberGameOracle.java
• NumberGameGuesser.java
• IntSeq.java
• IntSeqTester.java
• SimpleInput.java
• SimpleOutput.java