Without having any more info about the points and their interaction, scientifically speaking, you have to
connect the points using straight lines, which, by definition, produces a graph with its maximum on one of such a graph.
With this in mind, you can use the following method to find the maximum point:
- Pick two points, and find the slope of the connecting line.
- Compare this slope to the slope of the line connecting point 2 with point 3.
- Continue until the slope turns negative.
- The last point still giving you a positive slope is the maximum of your data set
This, of course, is an algorithm approximating a derivative, which is what you would want to do to find a maximum of a graph in the first place. However, since, as I've explained, the maximum will have to be on a data point, you should simply be able to sort the data points and get the maximum that way. I hope this helps at least somewhat.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.