Implement a function that accepts a PositionalList L of n integers sorted in nondecreasing order, and another

Question:

Implement a function that accepts a PositionalList L of n integers sorted in nondecreasing order, and another value V, and determines in O(n) time if there are two elements of L that sum precisely toV. The function should return a pair of positions of such elements, if found, or None otherwise.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Structures and Algorithms in Python

ISBN: 978-1118290279

1st edition

Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Question Posted: