Brute-Force Algorithm for 2D Maxima Problem

Use of Brute-Force Algorithm for 2D Maxima Problem

Let P = {p1, p2, . . . , pn } be the initial set of points. For each point pi, test it against all other points pj. If pi is not dominated by any other point, then output it.

MAXIMA (int n, Point P[1 . . . n])

for i <- 1 to n
do maximal <- true
    for j <- 1 to n
    do
        if(i )