basic algorithm

基本解释

With this basic algorithm for restore, it is easy to implement a simple infrastructure.
利用这种基本的恢复算法，很容易实现一种简单的基础设施。
As mentioned above, the basic algorithm imposes a minimum chunk size that can be very wasteful for very small requests.
如上面提到的，基本算法对于很小的请求也征用一个最小的块，这是十分浪费的。
In the most straightforward version of the basic algorithm, each freed chunk is immediately coalesced with neighbors to form the largest possible unused chunk.
在这个基本算法的最简单的版本中，每一个被释放的块被立即合并到相邻的块以形成一个尽可能最大的未使用块。