Posts Tagged ‘greedy algorithms’

This Saturday we return from our MATHCOUNTS hiatus with a great talk by Dr. Jonathan Kane, co-founder of the Purple Comet Math Meet.

Dr. Kane will discuss combining of fractions \frac{a}{b} and \frac{c}{d} by \frac{(a+c)}{(b+d)} to see what happens.  Sometimes this is what is done when combining groups of results and leads to Simpson’s paradox.  This also leads to very interesting behaviors when a teacher wants to drop the lowest grade from a collection of grades not all worth the same amount.  This talk will also touch on algorithms such as greedy algorithms where Dr. Kane will show cases where it works and cases where it does not work.

Read Full Post »

%d bloggers like this: