In Computer Science 12th edition textbook:

1) Write, in pseudocode, an algorithm that will double an integer until it is larger than 68.

2) Using the Insertion Sort Algorithm, put the following list in order. Show each step along the way, as shown in Figure 5.10 on page 229 of the textbook.

10

3

8

2

3) a) Given the following sorted list, how many steps will it take for a computer to find the name Ida using the Binary Search algorithm (and assuming any odd split will round down)? Show each step.

Alice

Bob

Carol

David

Ellen

Fred

Greta

Hubert

Ida

Jacob

b) if we used an iterative search structure instead of a recursive one, how many steps would the search in part a) take? Why?