Difference: ProgrammingTeam (9 vs. 10)

TBD: look at links at http://www.daffodilvarsity.edu.bd/acmsolver/teamnotebook/
extended GCD
Rubick's cube
bioinformatics "edit distance" algorithm -- Ducky, find this one
Line intersection.
Line segment intersection.
Line and line segment intersection.
Convex hull.
If a point is within a polygon.
From a large number of points what is the number of maximum points on a single line.
Closest pair problem. Given a set of points you have to find out the closest two points between them.
Try to learn how to use C's built-in qsort() function to sort integers and records.
Area of a polygon (convex or concave).
Center-of-gravity of a polygon (convex or concave).
Minimal circle, a circle with the minimum radius that can include the coordinates for a given number of points.
Minimal sphere.
Whether a rectangle fits in another rectangle even with rotation.
Identify where two circles intersect. If they don't, determine whether one circle is inside another or if they are far away.
Line clipping algorithms against a rectangle, circle, or ellipse.

-- DuckySherwood - 23 Nov 2007