首页 > 代码库 > Manipulating Data Structures
Manipulating Data Structures
Computer Science An Overview _J. Glenn Brookshear _11th Edition
We have seen that the way data structures are actually stored in a computer’s
memory is not the same as the conceptual structure envisioned by the user.
A two-dimensional homogeneous array is not actually stored as a two-dimensional
rectangular block, and a list or a tree might actually consist of small pieces scat-
tered over a large area of memory.
Hence, to allow the user to access the structure as an abstract tool, we must
shield the user from the complexities of the actual storage system. This means
that instructions given by the user (and stated in terms of the abstract tool) must
be converted into steps that are appropriate for the actual storage system. In the
case of homogeneous arrays, we have seen how this can be done by using an
address polynomial to convert row and column indices into memory cell
addresses.
Manipulating Data Structures
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。