analysis of algorithms

$10-30 USD

Cerrado

Publicado

hace más de 7 años

$10-30 USD

Pagado a la entrega

suppose an algorithm has time complexity written has T(n)=2T(n-1) +n*T(n-2) write the pseudo code for this method

Analytics

ID del proyecto: 11606461

Información sobre el proyecto

5 propuestas

Proyecto remoto

Activo hace 7 años

¿Buscas ganar dinero?

Dirección de email

Beneficios de presentar ofertas en Freelancer

Fija tu plazo y presupuesto

Cobra por tu trabajo

Describe tu propuesta

Es gratis registrarse y presentar ofertas en los trabajos

5 freelancers están ofertando un promedio de $49 USD por este trabajo

@maghnani

Hi...this is a complex analytics algorithm and the budget you have mentioned is slightly lesser for this project. I can do this work for you as I am a Six Sigma certified professional with experience in Analytics and have access to latest analytics tool including predictive and cognitive analytics. Please let me know if you are good with the budget and ping me if you would like to take this forward.

$55 USD en 2 días

0,0

(0 comentarios)

0,0

@antonparfeniuk

A proposal has not yet been provided

$100 USD en 1 día

0,0

(0 comentarios)

0,0

@aimsinbulleyes

Give me the chance. Will finish it in 2 days.

$35 USD en 2 días

0,0

(0 comentarios)

0,0

@freelancerLatino

Hello, so, one problem os size N is split into 2 problems os size N-1 PLUS a cost of merge partial solutions of N*T(N-2). So ... do you want a closed form for this recursive complexity time? or do you want to write any algorithm which has this complexity? Please, let me know. I am expert in algorithm and complexity.... I am professor of this field. Best Regards!

$30 USD en 1 día