The original version of this story appeared in Kuanta Magazine.com Magazine.com often solve an abstract problem that is difficult to understand, but the new algorithm algorithm is important to anyone who has a shelf. The algorithm solves the library sorting problem (more official, label label)). The challenge is to designate the books of alphability, for example you will create a new book on the shelf. Leave empty space To the right of the shelf. Then, if you add books with your collection, you must move on the book to make an outdoor operation. And if you get a book by Douglas Adams, you have to do everything again. Arching The better will leave a place that cannot be distributed throughout the sheet-but it is introduced to the library. This is because the problem also applies to the arrangement of the hard drive and database , where the items will be adjusted to be a billion number of billion. The incomplete system means significant time and the main computing cost. Researchers have invented an efficient way to store goods, but it has long wanted the most beautiful years, in the basis of the scientific conference in Chicago, researcher team showed a researcher to manage items that are suitable. The new approach joins a little knowledge of the content in the past books with a gorgeous random force. “Save information consecutive. They call the new work” very inspired [and] Easy one of these three favorite paper this year. “Sempit BoundSso how was the books of the books well? The general way was to see how much I had in the first place, the value was usually marked by N. In the example of Allende Allande, While all books have to move to complete the new, the more proportion of n. The more of the above “to make a problem: it will not get longer than the proportionate time to add one book to the shelf In the shelf in 1981 that was ignored if it could design algorithms with less than n. And it proves that something can be guaranteed to obtain the required time for (Log N) 2. This algorithm has two attributes: “Deterministic,” means that decision does not depend on random, and also “the book should be distributed below the rack (or elimination) made. The writer left about the question what the upper limit could be better. During the forty years, no one can do so.However, the intervention year is no improvement at the bottom border. When the top is subject to determine the maximum time required to attach a book, the bottom is the fastest time. To find definitive solutions for problems, researchers make a narrow gap between upper and lower limits, Saen until they coincide. If that happens, the algorithm is considered optimal from the top and below, there is no room for further refinement.
