Databases
StackOverflow2013
Postsdbo
POC#: A Bounding Max and Min on Array[]
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POC#: A Bounding Max and Min on Array[]
    primarykey
    data
    text
    <p>Suppose I have a List. I'd like to be able to calculate semi-equi-distant max and min bounding points. I don't want to simply get the Max() and Min() its slightly more complicated.</p> <p>To start, I'd like to specify a point in the list in which the list can be divided. To make it easy for now, suppose that point is 0. I'd then like to specify the number of divisions. Example:</p> <pre><code>List&lt;int&gt; Array = {-9,-8,-7,-2,-1,0,1,6,9,12}; int Divisions = 4; int CutOff = 0; </code></pre> <p>So using these parameters I'd like to walk out to the extremes starting from 0 until there are 4 divisions. In this case the DivisionSize should be 6. </p> <p>So the algorithm would start at 0 and walk to -6 for 1 Division then walk to -12 for the 2nd division. -12 would then become the bounding Min for the purposes of this algorithm.</p> <p>The Max would then be calculated by starting at 0 and walking to 6, then 12. The bounding Max would then be 12. Its okay if the Calculate Max and Min are the actual Max and Min of the list, this is just an unlikely case.</p> <p>I'm basically have some issues calculating the DivisionSize. I started with (Abs(Max)+Abs(Min))/Divisions but I can't seem to get the edge case where the Calculated size of the each division needs to be expanded to actually encompass the original Min and Max. Can somebody provided some guidance?</p> <p>Edit: I don't necessarily want the BoundedMax and BoundedMin to be symmetrical about the cutoff. I want to add slack to either side of the cutoff until the BoundedMin and BoundedMax are >= and &lt;= the range of the List.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USDavid
    1. USDavid
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. CO`Abs(Max)-Abs(Min)` sounds very wrong. Do you mean `Abs(Max - Min)`?
      singulars
      1. POC#: A Bounding Max and Min on Array[]
      1. USleppie
    2. COSupposed to be a +. Fixed thanks.
      singulars
      1. POC#: A Bounding Max and Min on Array[]
      1. USDavid
    3. COIt must be `Abs(Max - Min)`. Consider `Max = 102`, `Min = 98`; division size would be 50 when in reality it should be 26.
      singulars
      1. POC#: A Bounding Max and Min on Array[]
      1. USKirk Broadhurst
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload