KRHS Internet Lesson

Teacher Name:Mr. Rung                          Date of Lesson: May/June

Course Name: C++                    Lesson Name: Chap 19.1a

Student Name

Password

Objective
To complete the workbook exercises.

Primary Focus
Answer the questions below.

Site Links
Course Home Page

Additional Resources

Site Links

Question #1

The key field is the field by which the data is sorted.

True         False

Question #2

The divide and conquer approach to sorting is characterized by loops which pass through the list one element at a time.

True         False

Question #3

The number of elements in the list to be sorted is known as the key size.

True         False

Question #4

The selection sort is one of the easiest sorts to implement.

True         False

Question #5

An insertion sort uses a divide and conquer approach.

True         False