Algorithm Design

$10-30 USD

In Progress

Posted

about 8 years ago

$10-30 USD

Paid on delivery

Given an array of Points b[0..n-1], each having .x and .y coordinates. n may be large. Devise an efficient algorithm for problem:Given an area, find the max number of points contained in a rectangle with the given area. I want it to be done on time complexity O(n^2 *k) where k is max points in rectangle or better.

Algorithm

Project ID: 10247444

About the project

5 proposals

Remote project

Active 8 yrs ago

Looking to make some money?

Email address

Benefits of bidding on Freelancer

Set your budget and timeframe

Get paid for your work

Outline your proposal

It's free to sign up and bid on jobs

Awarded to:

@algor7

Algorithm is one of my favorite papers. I am a CSE(Computer Science and Engineering) graduate. I can do this task.

$25 USD in 1 day

0.0

(0 reviews)

0.0

@lashabuxo

I know solution in O(n^2 k) contact me , I know solution in O(n^2 k) contact me , I know solution in O(n^2 k) contact me ,

$30 USD in 1 day

5.0

(8 reviews)

3.9

5 freelancers are bidding on average $30 USD for this job

@utkarshkatiyar19

Hi. i have a lot of experience in Algorithms. I can easily help you with this project in given time. we can have a chat about it. thanks.

$40 USD in 1 day

4.9

(296 reviews)

7.3

@IFI91

Hello software engineer here group of 5 developers experts with penalty of experience can provide you quality work in given time inbox me asap so we can start waiting Thanks

$24 USD in 1 day