string decompose
€8-30 EUR
货到付款
Longest Closed Factor Array of a string w and an algorithm which computes it in O(n log n / loglog n) time and O(n) space.
n is the length of w.
Closed Factorization of a string w and the algorithm which compute it in O(n) time and space.
n is the length of w.
项目ID： #17451475
关于项目
授予：
有4名威客正在参与此工作的竞标，均价€30/小时
Hi! I'm interesting your project very well. I am a full time devloper. I am mastering c++ and I'm a good Mathematician. And also I have many experience and good skill about algorithm development. Let's go ahead w 更多
Hi, I can do this project of closed factorization. I will also comment out the code for your understanding. Knock me for more details. Thanks
i can decompose string in C . I hold a degree in Computer Engineering. I minored in Programming with a focus in c,c++, assembly. Whether independent or operating on a team my analytical approach to problem solving has 更多
