string decompose

Completado Publicado hace 5 años Pagado a la entrega
Completado Pagado a la entrega

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.

Algoritmos Programación en C Programación en C++ Java Mathlab y Mathematica

Nº del proyecto: #17451475

Sobre el proyecto

4 propuestas Proyecto remoto Activo hace 5 años

Adjudicado a:

AMancer

hi my suggestion is to implement a Java application. contact me for further details

€40 EUR en 1 día
(12 comentarios)
3.8

4 freelancers están ofertando un promedio de €30 por este trabajo

liangjongai

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 Más

€30 EUR en 1 día
(292 comentarios)
7.6
PiasKumarDas

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

€23 EUR en 1 día
(76 comentarios)
5.6
roshanasim

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 Más

€25 EUR en 1 día
(15 comentarios)
4.4