Based on the recursion technique, compute the cantor set.The Cantor set is obtained by removing from the segment [0,1] the middle thirds.For the given N (the number of steps), your code should display a narrow black rectangle with removed pieces (in white). As the final outcome, plot 6 first steps (in the same figure) of construction
of the Cantor set. Your graph should be a column consisting of 6 stripes.
fill([x1 x2 x3 x4], [y1 y2 y3 y4],'k');
For this question, I just manage to do the beginning .but I don't know how to apply the cantor set rule in matlab. I really don't know how to put it in atlab. May anyone help me please?
0 · ·