Coding for Fun and musing on gaming and development
Join the fray by commenting, tracking what others have to say, or linking to it from your blog.
Part 6: Efficiently Representing Sets Scott Mitchell Summary: Scott Mitchell discusses data structures for implementing general and disjoint sets. A set is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways.
Take a moment to comment and tell us what you think. Some basic HTML is allowed for formatting.
Name (required)
E-mail (required)
Website
Remember me
Be the first to comment!