An example showing Bézier Curve of any order using De Casteljau's algorithm of applying recursive linear interpolation (lerp) between a given set of control points. First, a group of linearly interpolating points is calculated between the pairs of consecutive data points. Then, those points are used as new control points to calculate the second set of linearly interpolating points. This method is applied repeatedly until the point tracing the Bézier Curve is obtained. In the code here, all those intermediate interpolating points and lines are shown to understand the method easily. Although the algorithm is computationally expensive for larger use, due to its recursive nature, it is numerically very stable and easy to understand and interpret geometrically.
This code is inspired by the SoME1 winning math video 'The Beauty of Bézier Curves' by Freya Holmér.
Check out this live demo.