这篇博客记录了Berkeley CS61B课程的学习进度，涵盖了范围搜索、多维数据、树与图遍历、最短路径、最小生成树、问题归约和分解、基本排序算法如快速排序，以及软件工程的相关内容。重点讨论了用于多维数据的K-d树和四叉树，以及在数据结构和算法中的应用。
仅供自勉和记录所用, copyright is held by Berkeley CS61B
- 刷题记录在Dropbox Paper上
- 2019 July 2 || Range Searching and Multi-Dimensional Data
- 2019 July 3 || Tree and Graph Traversals
- 2019 July 3 || Graph Traversals and Implementations
- 2019 July 4 || Shortest Paths
- 2019 July 5 || Minimum Spanning Trees
- 2019 July 6 || Reductions and Decomposition
- 2019 July 7 || Basic Sorts
- 2019 July 7 || Quick Sort
- 2019 July 8 || Software Engineering I
- 2019 July 8 || More Quick Sort, Sorting Summary
刷题记录在Dropbox Paper上
2019 July 2 || Range Searching and Multi-Dimensional Data
-
Multidimensional data has interesting operations:
- Range Finding: What are all the objects inside this (rectangular) subspace?
- Nearest: What is the closest object to a specific point?
- Can be generalized to k-nearest.
-
The most common approach is spatial partitioning:
- Uniform Partitioning: Analogous to hashing.
- Quadtree: Generalized 2D BST where each node “owns” 4 subspaces.
- K-d Tree: Generalized k-d BST where each node “owns” 2 subspaces.
- Dimension of ownership cycles with each level of depth in tree.
(Spatial partitioning allows for pruning of the search space.)
2019 July 3 || Tree and Graph Traversals
2019 July 3 || Graph Traversals and Implementations
2019 July 4 || Shortest Paths
2019 July 5 || Minimum Spanning Trees
2019 July 6 || Reductions and Decomposition
- Applications
- BUILD‐MAX‐HEAP is O(n).
2019 July 7 || Basic Sorts
扫一扫
701
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
