What are the difference between CGC and 3m.Both has some advantage or disadvantage ? Or It is just about running time or compilation time.I know that garbage collector is responsible for clearing up the shared memory. I dont know the whole issue on running time and compilation time. Running time is same with compilation time.? Or running time is the time about caring algorithm. For example running time of merge sort is nlogn .This nlogn include only time until array is sorted(I assume array is unsorted in first time) or include this plus "clearing shared memory".Anyway sorry for my bad english i hope i can tell my point. But i just wonder about CGC and 3m. What do we exactly focus on "garbage collector". <div class="gmail_quote">On Sun, Apr 5, 2009 at 1:59 AM, Marek Kubica <<a href="mailto:marek@xivilization.net">marek@xivilization.net</a>> wrote: <blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">On Sun, 5 Apr 2009 01:43:33 +0300 <div class="im">emre berat nebiođlu <<a href="mailto:beratn@gmail.com">beratn@gmail.com</a>> wrote: </div><div class="im">> Someone said to me Drscheme has 3 or 4 garbage collector.Is it true ? > If it is true.How it works and how drscheme uses tese. </div>MzScheme (the actual Scheme implementation that runs in the background of DrScheme) supports two different Garbage Collectors: the older CGC collector and the newer 3m collector. But the collector-selection happens on compile time - that is when MzScheme runs, there can only be one collector active, which is usually 3m since it is the default. regards, Marek </blockquote></div>