Home

Welcome to the DSA-Demo-Library wiki!

// Print all permutations of n numbers.
void printAllPermutations(int n);

class Point {
    public float x;
    public float y;
}

// Determine whether p lies inside the convex polygon defined by the points. Hint: use raycasting.
bool isPointInPolygon(Point p, ArrayList<Point> polygon);

Save Jim Raynor!

Alldig

Line segment cutting

Minesweeper (Hint: Use the gift wrapping algorithm or Graham's scan)

Tower builder

Such permutation. Very prime. So wow.

Author solutions and extra tests can be found here: http://www.math.bas.bg/infos/comp.html