This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
Best of all, the numerous repetitions you need, to practice the piece, will commit it to memory in a way that no other memorizing procedure will ever achieve, at no extra cost of time.
最妙的是，练习曲子时所必需的无数遍重复能够以一种其他记忆方式无法比拟的方式让你牢记乐谱，且不用花费额外的时间。
The extra spending in the algorithm was studied to optimize the execution and communication of the algorithm and reduce the cost of memory.
通过研究算法中的额外开销达到优化标量算法的执行和通讯，并减少了存储开销。
应用推荐