Implement Algorithm into BST C++

  • Status Completed
  • Budget £20 - £250 GBP
  • Total Bids 21

Project Description

Please do not bid unless you are familiar with the Subset-Cover scheme [NNL01]. Required: Subset cover scheme implemented into a BST in C++. Given set of Users and set of revoked users, find a disjoint subset which should not include revoked users.

Code for BST already developed but will need tweaking and so scheme needs implementation into BST.

Get free quotes for a project like this
Completed by:

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online