Re: [Algorithms] sort and sweep / sweep and prune and just touching objects

[Jon W. <jw...@gm...>]

Pau...@sc... 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