The Art of Computer Programming, Volume 1
2.2 LINEAR LISTS
2.2.1 Stacks, Queues, and Deques, pg. 238
[...]
We must decide in each case how much structure to represent in our tables, and how accessible to make each piece of information. To make such decisions, we need to know what operations are to be performed on the data. For each problem considered in this chapter, therefore, we consider not only the data structure but also the class of operations to be done on the data; the design of computer representations depends on the desired function of the data as well as on its intrinsic properties. Indeed, an emphasis on function as well as form is basic to design problems in general.
What I’ve been reading lately, part 57
-
The Couple at the Table — Sophie Hannah My second Sophie Hannah, which I
snapped up having enjoyed Haven’t They Grown? so much. Maybe this isn’t
quite so c...
1 day ago
No comments:
Post a Comment