176985602337900

Find freelancers. Lose those costly delays.

With 1.7 million freelancers, we'll match you with the perfect talent.

or, Register with Elance »

C# Algorithm
Sign in to Add to Watch List

IT & Programming > Other IT & Programming

View Change History

The client has made the following changes to the job.

Description
Date

Job canceled.

Dec 29, 2012
Close

Job Description

  |  Change History >>

Updated

Close
  • Posted: Sat, Dec 29, 2012
  • Time Left: Closed
  • Location: Anywhere
  • Client prefers freelancers from:
    Anywhere

    You are still able to submit a proposal for this job.

    The client prefers freelancers from
    a different location.

    You're still able to submit a proposal for this job, regardless of your location.
  • Start: Immediately
  • Budget: About $20
  • Fixed Price Job
  • Elance Escrow Protection
  • U.S. freelancers must have W9
Sign in to view client's details

Find the length of the longest increasing sequence through adjacent numbers (including diagonals) in a rectangular grid of numbers in a language of your choice. The solution should handle grids of arbitrary width and height.

For example, in the following grid, one legal path (though not the longest) that could be traced is 0->3->7->9 and its length would be 4.

8 2 4

0 7 1

3 7 9

The path can only connect adjacent locations (you could not connect 8 -> 9), and cannot connect equal numbers (you could not connect 7 -> 7). The longest possible sequence for this example would be of length 5 by tracing the path 0->2->4->7->9 or 1->2->4->7->8.

Sign in or Register to see more

Desired Skills
C#, C++
Job ID: 36388414
Proposals
Avg $ | High $ | Low $ — Show Pricing
  • Submit Date (Latest)
There are no proposals yet.
Sign in to Elance and start working on jobs today.
Sign in to view more of the job details and submit a proposal. Once registered, you'll have access to thousands of jobs online or through email.
Are you ready to post a job like this one?
Post a Similar Job »