Greetings.

I'm developing for my software D-form a depth sort renderer.
For the first draft I did a raw bubblesort and it worked OK.

Now, which algorithm is faster betwenn quicksort, mergesort, and
heapsort (or any other)?

I have read that mergesort is better than quicksort when data is
partially ordered. This seems to be the case.
Where to find on the net the algorithms (not the sources, just theory)?

A last question. I confronted the average Z coordinates of each poly to
determine the nearer. Are there better methods?

Thank you in advance

*** To answer by mail remove the "X" ***

(---------------------------------------------------------------)
( Diego Krota   http://www.geocities.com/SiliconValley/Way/2419 )
(---------------------------------------------------------------)
(      Never do anything you wouldn't be caught dead doing      )
(---------------------------------------------------------------)

Post a reply to this message