I'm curious about the complexity, in terms of Big or little O notation, of watershed delineation algorithms:

  1. Does the time required to perform a watershed delineation depend on the size of the input raster or on the size of the basin being delineated

  2. How does the time required to complete the delineation relate to the value in (1)

closed as too broad by PolyGeo Jun 4 at 6:17

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.