Also, the more memory a data structure uses, the less CPU time associated algorithms will need to process the data items–leading to faster algorithm results. As much as possible, you should ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...

Design algorithms and analyze their complexity in terms of running time and space usage; Create applications that are supported by highly efficient algorithms and data structures for the task at hand; ...