Answer
O(n)
Work Step by Step
Finding the largest algorithm takes n steps and running the algorithm after removing the element will also take n steps so the total steps required will be order of n.
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: 42c
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter 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.
