Re: request for advice on using Core Data
Re: request for advice on using Core Data
- Subject: Re: request for advice on using Core Data
- From: Wagner Truppel <email@hidden>
- Date: Wed, 20 Jun 2007 21:35:03 +0200
On 20 Jun 2007, at 20:45, John Stiles wrote:
Random curiosity—when would one prefer this structure to, say, a
red-black tree?
Probably never. The usefulness of this structure is in teaching. It's
more complicated than linked lists but not as complicated as binary
search trees. It also introduces the idea of balancing a data
structure to maintain a bound on the time complexity. And it has a
time complexity that is different than the usual log, linear, and log-
linear ones. You'd be surprised how many students in intro data
structure courses think that all algorithms have a time complexity
that's one of those three. It's good to be able to show them a DS
with a square-root time complexity.
Wagner_______________________________________________
Cocoa-dev mailing list (email@hidden)
Do not post admin requests or moderator comments to the list.
Contact the moderators at cocoa-dev-admins(at)lists.apple.com
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden