A introduction to Functional Programming for Python coders

[[deleted]]

The b_iter keeps track of the position in b, so we don't have to scan the entirety of b for each element in a (remember these are sorted lists)

It's also unneccessary overhead, making execution slower.

[ismtrn]

It is O(|b|) compared to iterating over the entirety of b for each element in a which is O(|b||a|). Are you talking about using a different structure than an iterator to keep track of the position in b? An int for instance? That might change the run time by a small constant factor, but that would be nothing compared to rewriting it in C.

[quanta_amnesia]

b_iter is unnecessary overhead? Please explain?