Invitation to Computer Science 8th Edition

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

Chapter 3 - Exercises - Page 142: 13


Yes. We are considering a list that is already sorted. Selection sort will initially search for the greatest element in the unsorted list and then swap it with the last element in the unsorted list. This will happen even if the last element is already the largest. It will technically perform a swap for each iteration, even if the list is sorted. Bubble sort, on the other hand, will only perform a swap if a certain item is less than another item. There is a condition that has to be satisfied before performing the swap. This means that in a sorted list, no swaps shall be performed.

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.