You are given n points on a two-dimensional plane. Each point is specified by a tuple of X and Y coordinates. A point (x, y) is said to dominate point (x 0 , y0 ) if and only if x > x0 and y > y0 . Design an algorithm to output all points that are not dominated by any other point. Give pseudocode and discuss correctness and running time.

- 70

this is the answer for you hope it

answer: the proof is mentioned below.

step-by-step explanation:

since, given:   lines bc = ef

prove:   lines ac > ef

          statements                                           reason

1. bc=ef                                           1. given

2. ac= ab+bc                                 2. because b is the point between the  

                                                            line segment ac

3.   ac > bc                                       3. because if a line segment is equal to

                                                          the sum of two line segments then it is

                                                          always greater then each of these

                                                          individual line segments

4. ac > ef                                         4. by equality property.

ℓσℓ ιт ∂σит тяσυвℓє мє αт αℓℓ ιм gℓα∂ тσ нєℓρ ρρℓ συт

ωє ιт ¢αи вє ωяιттєи αѕ

step-by-step explanation:

нσρє ι ¢συℓ∂ нєℓρ уσυ συт