The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.
最后，本文还给出了LDST与线性四叉树之间的转换算法及时间复杂度分析。
Its time complexity is o (n), and its appended storage space is very small. The algorithm particularly suits to the situation of large amounts of data.
该算法的时间复杂度为O (N)，且附加存储空间极小，特别适合于数据量大的场合。
Its time complexity is o (n), and its appended storage space is very small. The algorithm particularly suits to the situation of large amounts of data.
该算法的时间复杂度为O (N)，且附加存储空间极小，特别适合于数据量大的场合。
应用推荐