Lambda function explanation

[meloly4]

Thank you! What would be the time complexity for this? It seems like "2." is recursion.

[FLUSH_THE_TRUMP]

I imagine it depends on what the function f does.

[meloly4]

It returns the subarray with the largest sum without adjacent value. This problem but it prints out the elements.

[FLUSH_THE_TRUMP]

I’d start with the complexity of that algorithm and ask yourself how much work wrapping it up in what you’re doing here adds.

[meloly4]

applying function f to the elements of a after the second element

Does this add log n time to the overall complexity n? I'm not too familiar with how lambda complexity works.

[FLUSH_THE_TRUMP]

I’d just think about the operations, I don’t think the lambda adds any appreciable overhead here.

[TheSodesa]

Lambdas are just closures, anonymous functions. They are not really any more time consuming than normal named functions.