月弦音

Weighted graphs: Different from the unweighted graph,the weighted graph's edge is weig...

DFS & BFS： DFS different from BFS,it solves the problem about reachability.BFS is to f...

Graph Defination: Directed edges are ordered edges Undirected edges are unorded edges ...

Priority Queue Interface: Keep track of many items, quickly find the most important on...

一路自学编程搜集的资源Teach Yourself Computer Science 自学计算机科学 Teach Yourself Programming in Ten Y...

Height Balance: maintain the height of the tree is $O(logn)$ AVL Tree Rotations: Chang...

Binary tree: def: pointer-based data structure,it has three pointers each node. repres...

低频信息和高频信息： 低频信息： 低频信息描述图像的整体轮廓和大致形状等粗糙的特征 描述了图像的全局信息，为整体提供结构基础 高频信息： 高频信息描述图像细节，纹理和图像边...

Comparison Sort Lower Bound: Leaves$\ge$ possible outputs,height is lower bound$\Omega...

1-2:Stone Searching In a infinite reange,try to find number k Solution: We want to use...

DirectAccessArray: Any item x with key k will be stored in array index k. We can find ...

A fast set: sorted array: In this data structure, we can find the item easility by the...

Permutation Sort: For each permuatation, check each whether is orded Analysis: You wil...

Problen session: 1-2: (a) Code: (b): 1-4： 问题描述： 我们要将一个长度为2n的链表，分为两个长度为n的部分，但同时要保证后半段链表...

Array sequence: set_at and get_at only need $O(1)$time,but delete and insert needs lin...

What demand ? Theory: basic representations(digitally encode shape) sampling & aliasin...

Comparison Sort Lower Bound leaves' number: For permutaion, $n!$ results,leaf represen...

Comparison Model(比较模型): Comparable items: 将元素看作black boxes，他们的数据是不透明的，只能通过不断比较得出数据（相对顺...

动机： find max/min item: 对于一个set来讲，当查询一个最大/小值时，遍历所有item固然可以，不过要花费$\theta(n)$的时间，效率较慢，可是当...

Data Structures Interfaces: collection of supported operations is called interface( al...