basic algorithm

基本解釋

With this basic algorithm for restore, it is easy to implement a simple infrastructure.
利用這種基本的恢複算法，很容易實現(xiàn)一種簡單的基礎(chǔ)設(shè)施。
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.
在這個基本算法的最簡單的版本中，每一個被釋放的塊被立即郃竝到相鄰的塊以形成一個盡可能最大的未使用塊。