Invitation to Computer Science 8th Edition

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

Chapter 3 - Exercises - Page 146: 36c

Answer

O($N^{2}$)

Work Step by Step

The first loop iterates over all nodes and the inner loop also iterates over all nodes so the total number of operations is O($N^{2}$).
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.