U++ forum: Welcome to the forum

Re: Quiz #5 [message #57913 is a reply to message #57912]

Tue, 28 December 2021 03:04

Lance
Messages: 527
Registered: March 2007

Contributor

It's good to understand the logic the system used to order Ctrls. So I copy the Predicate here

bool RectLess(const Rect& a, const Rect& b)
{
	int d = min(a.bottom, b.bottom) - max(a.top, b.top);
	int w = min(a.GetHeight(), b.GetHeight());
	return d > w / 2 ? a.left < b.left : a.top < b.top;
}

If the height of common vertical part is over half of height of the shorter ctrs, compare horizontally, otherwise , compare vertically.

Given any two Ctrls, the predicate is deterministic. Is this predicate not transitive, ie. a<b, b<c doesn't imply a<c? What if we pass the predicate to a quicksort like algorithm?

[Updated on: Tue, 28 December 2021 03:05]

Report message to a moderator