Invitation to Computer Science 8th Edition

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

Chapter 3 - Exercises - Page 143: 18c


We see that all possible lists are generated anyway, in the first loop, so we have the best possible case when the first list permutation generated is sorted. Thus, this gives 1 work unit for the second loop, giving us $$ n! +1 $$ work units in the best case. Similarly, in the worst case, the last list is sorted, giving us: $$ n!+n! =2n! $$ work units.

Work Step by Step

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.