Invitation to Computer Science 8th Edition

by Gersting, Judith L.; Schneider, G. Michael

Published by Cengage Learning

ISBN 10: 1337561916

ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 148: 42a

Answer

$O(n)$

Work Step by Step

The mentioned algorithm will check every element once so the number of operation will be the order of number of elements.

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.