-
### Background and motivation
For a long time I've been annoyed at the fact that a dictionary is an `ISet` yet we cannot use set operations over them, except... by manual `foreach`. At the same tim…
-
Add more algorithms and data structures to the repository, that are not already present.
Also add the explanation for the algorithms in markdown format.
-
**Describe the solution you'd like**
We want to experiment adding a real read prefetch solution to the Segment Store for select segments.
Proposed idea:
- Consider reading `Y` bytes from offset `…
-
# 第六周：字典树和并查集
1.字典树(Trie)又称单词查找树或键树，是一种树形结构，典型应用是用于统计和排序大量的字符串。
优点：最大限度减少无谓字符比较，查询效率比哈希表高
基本性质：
1.结点本身不存完整单词
2.从根结点到某一结点，路径上经过的字符连接起来，为该结点对应的字符串
3.每个结点的所有子结点代表的…
-
### AVL实现
```
package avl;
/**
* @author zhangran
* @since 2020-04-26
**/
public class AvlTree {
private class Node {
public K k;
public V v;
public Node …
-
명령어에 인자(Parameter)가 모자라거나 필요 이상으로 입력 받을 시 에러 코드를 출력한다. 라고 명시되어 있는데 이러한 경우는 잘못된 명령어(800)로 봐야 하는 건가요?
-
### 第13课 字典树和并查级
##### 字典树 Trie
字典树的数据结构
**Trie 树** ，又称单词查找树或键树，是一种树形结构。典型应用是用于统计和排序大量的字符串（但不仅限于字符串），
**应用**：经常被搜索引擎系统用于文本词频统计。
**优点**：最大限度地减少无谓的字符串比较，查询效率比哈希表高。
**字典树的核心思想**
- Trie 树的核心思想是空间…
-
- I tried searching in the helix tutor, helix command palette, & helix documentation,
- ... but couldn't find a way to use sticky Replace mode.
- I am on helix 22.12 (96ff64a8) on windows 10 20…
-
-
# Creating the `DemandQueue`
Each dealer in our scheme has a _queue of demand_ where a `sim-exchange` user's
order is placed after clicking "Accept My Deal." A user's order remains in this
queue …