数据结构与算法术语

中文	英文	例句
数组	Array	"We can use a hash map to optimize this array traversal."
链表	Linked List	"A linked list allows O(1) insertion at the head."
栈	Stack	"We'll use a stack to keep track of the parentheses."
队列	Queue	"For BFS, we need a queue to process nodes level by level."
哈希表	Hash Map / Hash Table	"Let's use a hash map to store the frequency of each element."
集合	Set	"A set can help us remove duplicates efficiently."
树	Tree	"This problem can be modeled as a tree structure."
二叉树	Binary Tree	"In a binary tree, each node has at most two children."
二叉搜索树	Binary Search Tree (BST)	"A BST allows O(log n) search in the average case."
堆	Heap	"We can use a min-heap to always get the smallest element."
图	Graph	"We need to represent this as a graph with edges and vertices."
字典树	Trie	"A trie is perfect for prefix-based searches."

中文	英文	例句
时间复杂度	Time Complexity	"The time complexity of this solution is O(n log n)."
空间复杂度	Space Complexity	"We're trading space complexity for faster lookup."
常数时间	Constant Time / O(1)	"Hash map lookup is O(1) on average."
线性时间	Linear Time / O(n)	"This runs in linear time since we only traverse once."
对数时间	Logarithmic Time / O(log n)	"Binary search runs in logarithmic time."
平方时间	Quadratic Time / O(n²)	"The nested loop results in quadratic time."
最坏情况	Worst Case	"In the worst case, we might need to check all elements."
平均情况	Average Case	"The average case is much better due to hash distribution."
最好情况	Best Case	"In the best case, the target is at the first position."

中文	英文	例句
二分查找	Binary Search	"We can apply binary search since the array is sorted."
深度优先搜索	Depth-First Search (DFS)	"DFS is useful for exploring all paths in a graph."
广度优先搜索	Breadth-First Search (BFS)	"Use BFS to find the shortest path in an unweighted graph."
动态规划	Dynamic Programming (DP)	"This is a classic dynamic programming problem."
贪心算法	Greedy Algorithm	"A greedy approach works here because local optimum leads to global optimum."
回溯	Backtracking	"We can use backtracking to generate all possible combinations."
分治	Divide and Conquer	"Divide and conquer breaks the problem into smaller subproblems."
滑动窗口	Sliding Window	"The sliding window technique is perfect for substring problems."
双指针	Two Pointers	"The two pointers approach reduces time from O(n²) to O(n)."
递归	Recursion	"We can solve this using recursion with a base case."
迭代	Iteration	"Let's convert the recursive solution to iteration to save space."

中文	英文	例句
排序	Sorting	"After sorting, we can use two pointers."
归并排序	Merge Sort	"Merge sort has stable O(n log n) performance."
快速排序	Quick Sort	"Quick sort is often faster in practice despite worst-case O(n²)."
堆排序	Heap Sort	"Heap sort is useful when memory is limited."
拓扑排序	Topological Sort	"Topological sort helps determine the order of dependencies."
查找	Search / Lookup	"We need an efficient lookup mechanism."
遍历	Traverse / Traversal	"We'll traverse the tree in-order."

系统设计术语

中文	英文	例句
分布式系统	Distributed System	"We need to design a distributed system to handle high traffic."
微服务	Microservices	"We'll break the monolith into microservices."
单体应用	Monolithic Application	"Starting with a monolithic architecture is simpler."
负载均衡	Load Balancing	"Load balancing distributes traffic across multiple servers."
水平扩展	Horizontal Scaling	"Horizontal scaling means adding more machines."
垂直扩展	Vertical Scaling	"Vertical scaling means upgrading existing hardware."
高可用	High Availability (HA)	"We need high availability with 99.99% uptime."
容错	Fault Tolerance	"The system should have fault tolerance to handle failures."
冗余	Redundancy	"We'll add redundancy to prevent single points of failure."

中文	英文	例句
关系型数据库	Relational Database (RDBMS)	"We'll use a relational database for transactional data."
非关系型数据库	NoSQL Database	"A NoSQL database is better for unstructured data."
缓存	Cache	"We can use Redis as a cache layer."
索引	Index	"Adding an index will speed up queries."
分片	Sharding	"Sharding helps distribute data across multiple servers."
复制	Replication	"We'll set up replication for data redundancy."
主从复制	Master-Slave Replication	"Master-slave replication allows read scaling."
一致性	Consistency	"We need to choose between strong and eventual consistency."
分区	Partition	"We'll partition the data by user ID."

中文	英文	例句
延迟	Latency	"We need to reduce latency to under 100ms."
吞吐量	Throughput	"The system should handle high throughput."
瓶颈	Bottleneck	"The database is the bottleneck in our system."
缓存命中率	Cache Hit Rate	"A high cache hit rate reduces database load."
连接池	Connection Pool	"We'll use a connection pool to manage database connections."
限流	Rate Limiting	"Rate limiting prevents abuse of our API."
熔断	Circuit Breaker	"The circuit breaker pattern prevents cascading failures."
降级	Degradation	"We'll implement graceful degradation during high load."

中文	英文	例句
消息队列	Message Queue	"We'll use a message queue for async processing."
发布订阅	Publish-Subscribe (Pub/Sub)	"The pub-sub pattern decouples producers and consumers."
API	Application Programming Interface	"We'll design a RESTful API for the service."
REST	Representational State Transfer	"REST is a common architectural style for web services."
GraphQL	GraphQL	"GraphQL allows clients to request exactly what they need."
RPC	Remote Procedure Call	"We can use RPC for internal service communication."
WebSocket	WebSocket	"WebSocket enables real-time bidirectional communication."
轮询	Polling	"Polling is simpler but less efficient than WebSocket."

中文	英文	例句
遍历	traverse	"We'll traverse the array once."
迭代	iterate	"Let's iterate through each element."
比较	compare	"We need to compare adjacent elements."
存储	store	"We'll store the result in a hash map."
查找	look up	"We can look up the value in O(1) time."
更新	update	"Then we update the maximum value."
返回	return	"Finally, we return the result."
初始化	initialize	"First, we initialize an empty hash map."
递归调用	recursively call	"We'll recursively call the function on the left subtree."
回溯	backtrack	"When we hit a dead end, we backtrack."

中文	英文	例句
是	is / runs in	"This runs in O(n) time."
需要	requires	"This requires O(n) extra space."
因为	because / since	"This is O(n²) because of the nested loop."
导致	leads to / results in	"The extra array leads to O(n) space."
优化	optimize	"We can optimize this using a hash map."
减少	reduce	"This reduces time from O(n²) to O(n)."
牺牲	sacrifice / trade	"We're trading space for time."
分摊	amortized	"The amortized time complexity is O(1)."

中文	英文	例句
边界情况	edge case	"Let's consider some edge cases."
空输入	empty input	"What if the input is empty?"
空指针	null pointer	"We need to handle null pointers."
重复元素	duplicate elements	"The array might contain duplicates."
负数	negative numbers	"What if there are negative numbers?"
溢出	overflow	"We should check for integer overflow."
假设	assume	"Let's assume the input is valid."