Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Main points of this lecture are Random, Access, Machine, Operations, Model, CPU, Maxima, Example.
Typology: Slides
1 / 13
This page cannot be seen from the preview
Don't miss anything!
and division) on integer values of any size • performing any comparison or booleanoperations • accessing an element of an array (e.g.
]) Docsity.com^ Algorithms – p. 25
=^ y; • z =^ a
z^
= a^
-^ b; -^ z^ =
a^ * b;
z^
= a^
/^ b;
-^ z^ =
w[10];
-^ (x^
<=^ y)
p^ in 2-dimensional space be given by its integer coordinates,
p^ = (
p.x, p.y
-^ A point
p^ is said to be
dominated
by point
q^ if
p.x^ ≤
q.x^ and
p.y^ ≤
q.y.
n^ points,
p, p^12
,... , p
}^ inn
2-space a point is said to be
maximal
if it is
not dominated by any other point in
y^ value means a cheap car and low
y
means expensive car. • Think of
y^ as the money left in your pocket after you have paid for the car. • Maximal points correspond to the fastest andcheapest cars.
p, p^12
,... , p
}^ inn
2-space, • output the set of maximal points of
-^ i.e., those points
psuch thati^
pis noti^
dominated by any other point of
