I just wanted to know where i can apply the concept of linked lists, or what kind of program requires linked lists application. If any body can help me, I will appreciate.
I just wanted to know where i can apply the concept of linked lists, or what kind of program requires linked lists application. If any body can help me, I will appreciate.
Let me give a brief example of a use of a linked list: Let's say I want to draw a Koch snowflake. Let's say I already have code for a turtle. The initiator can be a linked list with three elements. The data elements are an angle to turn, and a distance to draw, for my initiator, these elements are identical: 2pi/3,1.0. If this is an input to the draw function, an equilateral triangle is generated. Then I need an iterator function, but for generality's sake it should also be data-driven. Another linked list, 0,1/4, pi/6,1/4 pi/3, -2pi/3,1/4, pi/3,1/4 serves as the iterator data. Running the iterator substitutes the iterator for each element in the initiator, this structure becomes the new initiator, if we want. We have to add the amt of turn from the original segment to the amt of turn in the new elements to get the total turn for a given element. Now we have a twelve-element (for we have substituted 4 new segments for 3 old ones) list that renders a star-of-David when fed into the draw function.
To render successive iterations of the snowflake, we only have to re-run the iterator function and draw. We have to multiply the segment lengths by the new segment lengths if we want to maintain scaling. Else we can construct an auto-zoom viewer.
Then we can have some 425 and play with both data sets 'til mom or the kids come home.
If we can make the draw function, play a glissando out 'da speaker, rather than draw a line segment on da' monitor, we have crude models for both ontogeny and phylogeny.
//Apologies for my error above, sadly haven't played with any of this stuff for over a decade! Rusty, rusty rusty. Thanks for the correction.
Let me give a brief example of a use of a linked list: Let's say I want to draw a Koch snowflake. Let's say I already have code for a turtle. The initiator can be a linked list with three elements. The data elements are an angle to turn, and a distance to draw, for my initiator, these elements are identical: 2pi/3,1.0. If this is an input to the draw function, an equilateral triangle is generated. Then I need an iterator function, but for generality's sake it should also be data-driven. Another linked list, 0,1/4, pi/6,1/4 pi/3, -2pi/3,1/4, pi/3,1/4 serves as the iterator data. Running the iterator substitutes the iterator for each element in the initiator, this structure becomes the new initiator, if we want. We have to add the amt of turn from the original segment to the amt of turn in the new elements to get the total turn for a given element. Now we have a twelve-element (for we have substituted 4 new segments for 3 old ones) list that renders a star-of-David when fed into the draw function.
To render successive iterations of the snowflake, we only have to re-run the iterator function and draw. We have to multiply the segment lengths by the new segment lengths if we want to maintain scaling. Else we can construct an auto-zoom viewer.
Then we can have some 425 and play with both data sets 'til mom or the kids come home.
If we can make the draw function, play a glissando out 'da speaker, rather than draw a line segment on da' monitor, we have crude models for both ontogeny and phylogeny.
//Apologies for my error above, sadly haven't played with any of this stuff for over a decade! Rusty, rusty rusty. Thanks for the correction.