Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 3 - Section 3.1 - Algorithms - Exercises - Page 202: 5

Answer

Duplicates(a1, a2, . . . , an: integers in non decreasing order)

Work Step by Step

--procedure: -duplicates(a1, a2, . . . , an: integers in non decreasing order) -k := 0 {this counts the duplicates} -j := 2 -while j ≤ n -if aj = aj−1 then -k := k + 1 -ck := aj -while j ≤ n and aj = ck -j := j + 1 -j := j + 1 -{c1, c2, . . . , ck is the desired list}
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.