Pages tagged #

by . Last updated .

1. nedtries
Computer science theory classes teach students that associative containers (i.e. containers whose items are placed in some form of faster than O(n) access index) come in two main forms: (i) ordered, in which case it has O(log N) average lookup complexity and (ii) unordered, in which case it has O(1) average lookup complexity. The C++ Standard Template Library comes with std::map<> and std::unordered_map<> for precisely this reason - there is supposedly no other choice except for esoteric requirements such as indexing a few terabytes of data where, as Wikipedia will show you, you'll find all sorts of crazy indexation algorithms. ...


Contact the webmaster: Niall Douglas @ webmaster2<at symbol>nedprod.com (Last updated: 2010-06-19 00:00:00 +0000 UTC)