Re: sort and sweep / sweep and prune and just touching objects
Jon Watte <[email protected]>
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
[email protected] wrote: > So do i need to compare bound values in all cases? Is there another way > around this? > In a stable sort, you generally have a tie breaker, such as the "this" pointer of the value in question, in the case of a tie. Sincerely, jw ------------------------------------------------------------------------------ Crystal Reports - New Free Runtime and 30 Day Trial Check out the new simplified licensing option that enables unlimited royalty-free distribution of the report engine for externally facing server and web deployment. http://p.sf.net/sfu/businessobjects _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list