Given a binary function f, a starting value a, and a list (row vector) xs of values, the higher order function foldl folds the function f through the list from left to right. Your task is to provide a definition for foldl. Consider a recursive definition for elegance. Non-recursive definitions would be just fine as well.
Refer to the following mechanism as an example:
foldl(f,[4,7,5,6],2)
= foldl(f,[11,5,6],2)
= foldl(f,[16,6],2)
= foldl(f,[22],2)
= f(22,2)
= 24

Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
354 Solvers
-
438 Solvers
-
602 Solvers
-
Find out sum of prime number till given number
269 Solvers
-
560 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!