a factor of 10 on a binary tree needs some investigation. i'd be surprised if it's a compiler optimisation (given that it's recursive, and thus full of function calls, which might i suppose be tail recursive, but we don't know yet either way).
--- Begin Message ---Could it run faster on other operating systems because of compiler's optimizations on your program? Maybe 8c makes less optimizations and code runs slower because of that.Armando. pedro henrique antunes de oliveira escribió: > Well, i dont know if this is a plan9 question it self. > > I've writen a program using a data structure and the program spend > about 30 > secs to finish the task, some tima later I've compiled the same program > under other operating system, (and the same computer) and the program > finish > the task with 3 secs. > > > anyone knows what can it be? >
--- End Message ---
