📚 Common Standard Data Structures and Algorithms | 常用标准数据结构与算法
Data structures and algorithms are the foundation of computer science. A data structure is a systematic way of storing and organising data, while an algorithm is a finite sequence of precise steps used to solve a problem. Together they determine how efficiently a program stores information, searches for values, sorts records and responds to user actions.
数据结构与算法是计算机科学的基础。数据结构是存储和组织数据的系统化方式，而算法是用于解决问题的有限精确步骤序列。二者共同决定了程序如何高效地存储信息、查找数值、排序记录以及响应用户操作。
1. Why Data Structures and Algorithms Matter | 为什么数据结构和算法很重要
Choosing the right data structure can make an algorithm simple, fast and memory efficient. Choosing the wrong one can lead to slow programs, wasted memory and code that is difficult to maintain. For this reason, examination syllabuses place strong emphasis on standard structures and their associated operations.
选择合适的数据结构可以使算法简单、快速且节省内存；选择不当则会导致程序运行缓慢、浪费内存并使代码难以维护。因此，考试大纲非常重视标准结构及其相关操作。
An abstract data type describes what operations are allowed without saying how they are implemented. For example, a stack can be implemented using an array or a linked list, but from the user's point of view the operations are always push and pop. This separation of interface and implementation is a key idea in computer science.
抽象数据类型描述允许执行哪些操作，而不说明具体如何实现。例如，栈可以用数组或链表实现，但从用户角度看，操作始终是压栈和弹栈。接口与实现相分离是计算机科学中的重要思想。
A good algorithm must be correct, finite and efficient. Correctness means it produces the right output for every valid input. Finiteness means it stops after a finite number of steps. Efficiency is measured in terms of time and space, usually using Big-O notation.
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图