Talk:Cheney's algorithm: Difference between revisions

Content deleted Content added
Line 7:
{{Expand|date=June 2007}}
:Is this algorithm recursive? Will it copy objects referred to by something referred to by something referenced from the stack? If so, it is not described that way. -- [[User:Beland|Beland]] 17:19, 24 May 2007 (UTC)
:: It isn't strictly recursive, but it does reach all the objects youreferenced nameeven indirectly from the stack. Essentially, the stack and the heap both act as components of a queue, with you adding to the end of the heap any copied items, then forwarding the pointer in the queue. This results in a breadth-first approach to reaching all the items, since you won't reach the 'end' of the heap/queue until no more objects require copying and no more pointers require forwarding..
 
== Regarding Efficiency ==