双向字符串排序变换(Bijective String Sorting Transform)

编程入门行业动态更新时间:2024-10-23 04:39:20

我很难找到双向字符串排序变换的复杂性。有人知道变换的复杂性吗？

I have some difficulty finding the complexity of the Bijective String Sorting Transform. Does anybody know the complexity of the transform?

最满意答案

变换及其逆可以在线性时间内计算并消耗线性存储。查看以下文章。

The transform and its inverse can be computed in linear time and consuming linear storage. Check out the following paper.

更多推荐

本文发布于:2023-08-06 20:00:00，感谢您对本站的认可！

评论列表（有 0 条评论）