Optimal Binary Search C++

$20-100 USD

Zaprt

Objavljeno

pred več kot 19 leti

$20-100 USD

Plačilo ob dostavi

Explore the dynamic programming method for building an Optimal Binary Search Tree in C++. Specifically you will design a class (OptimalBST) that, given an array of n keys (int K[], do not assume that K is sorted!) and probabilities, (double P[]) of each key, builds an Optimal Binary Search Tree. Note that P[i] denotes the probability of key K[i] (p(ki)). Your function will return a pointer to the root node of the constructed binary search tree. I have created a header and source file that you must use, OptimalBST.h and OptimalBST.cpp. See the attached files. I need this project in 5-6 hours.

ID projekta: 9124

Več o projektu

2 ponudb

Projekt na daljavo

Aktivno pred 17 leti

Želite zaslužiti?

E-naslov

Prednosti oddajanja ponudb na Freelancerju

Nastavite svoj proračun in časovni okvir

Prejmite plačilo za svoje delo

Povzetek predloga

Registracija in oddajanje ponudb sta brezplačna

2 freelancerjev je oddalo ponudbo s povprečno vrednostjo $46 USD za to delo

@viaden

Hello. We're ready to help you and provide you with the best expert complete your project in the best way. We need to discuss everything before we tell you the final price, it depends on the amount of work. Our hourly rate is 12$, so, if everything can be done in 5-6 hours, we'll make it for 72$. Please, contact us to precise everything and we'll start. Regards, Viaden Inc.

$72 USD v 1 dnevu