@skliang200 — 21x breakout

Loading video…

What is Currying in CS

@skliang200

1.2K followers · usually 1.2K views a post

Views

23.8K

Likes

1.1K

Comments

Why it worked

The video provides a clear, concise explanation of a complex technical concept using a visual code example, making it highly educational and shareable for students and developers.

Summary

The creator explains the computer science concept of currying using a code example in Scala. They demonstrate how currying transforms a function with multiple arguments into a series of functions with single arguments.

Structure

1Define currying
2Explain the concept
3Show code example
4Explain the benefit

On-screen text

What is Currying in CS Currying is a topic that's a little bit advanced but the concept of it is actually really simple it's basically taking a function that takes multiple arguments and refactory it into multiple functions but each function only takes one argument so this is a very simple example of that instead of taking a and b, 2 parameters, in one single function we do it as in line 5 and you can see when we use it in line 7 it actually returns you a function so currying allows us to take a more general function like the curried add in this example and fine tune the specificity a little bit in this case we're saying add 3 the 3 is specific but it's still add function

Transcript

Currying is a topic that's a little bit advanced but the concept of it is actually really simple. It's basically taking a function that takes multiple arguments and refactory it into multiple functions but each function only takes one argument. So this is a very simple example of that. Instead of taking a and b, 2 parameters, in one single function we do it as in line 5 and you can see when we use it in line 7 it actually returns you a function. So currying allows us to take a more general function like the curried add in this example and fine tune the specificity a little bit. In this case we're saying add 3, the 3 is specific but it's still add function.