Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - 3.3 - Measuring Efficiency - Practice Problems - Page 109: 2

Answer

This question can be answered using the formulas from Section $3.3 .3 :$ Number of comparisons $=\frac{1}{2} n^{2}-\frac{1}{2} n$ $ \ \ \ \ \ \ $ Number of exchanges $=n$ $\begin{array}{lll}{\text { a. Comparisons: }} & {6} & {\text { Exchanges: }} & {4} \\ {\text { b. Comparisons: }} & {21} & {\text { Exchanges: }} & {7} \\ {\text { c. Comparisons: }} & {28} & {\text { Exchanges: }} & {8} \\ {\text { d. Comparisons: }} & {10} & {\text { Exchanges: }} & {5}\end{array}$

Work Step by Step

This question can be answered using the formulas from Section $3.3 .3 :$ Number of comparisons $=\frac{1}{2} n^{2}-\frac{1}{2} n$ $ \ \ \ \ \ \ $ Number of exchanges $=n$ $\begin{array}{lll}{\text { a. Comparisons: }} & {6} & {\text { Exchanges: }} & {4} \\ {\text { b. Comparisons: }} & {21} & {\text { Exchanges: }} & {7} \\ {\text { c. Comparisons: }} & {28} & {\text { Exchanges: }} & {8} \\ {\text { d. Comparisons: }} & {10} & {\text { Exchanges: }} & {5}\end{array}$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.