it returns a point such that the sum of distances from that point to all points in p is minimum O(n log^2 MX)

ax + by + c = 0

returns the circle such that for all points w on the circumference of the circle dist(w, a) : dist(w, b) = rp : rq rp != rq https://en.wikipedia.org/w

returns two circle c1, c2 through points a, b and of radius r 0 if there is no such circle, 1 if one circle, 2 if two circle

0 if cw, 1 if ccw

given a list of lengths of the sides of a polygon in counterclockwise order returns the maximum area of a non-degenerate polygon that can be formed us

parent of u in the rep. tree

https://desktop.arcgis.com/en/arcmap/10.7/map/projections/geographic-coordinate-system.htm given the radius of the sphere, latitude and longitude of a

returns value of index pos

kth node from u to v, 0th node is u

The shortest distance between two points A and B on a sphere (O, r) is given by travelling along plane OAB and on the surface of the sphere. It is cal

height of the cap (just like real world cap)

inorder traversal to get indexes chronologically

insert x into the i-th index

returns the intersection point of the line with plane p assuming plane and line are not parallel

O(nlog^2n)

checks if convex or not

-1 if strictly inside, 0 if on the polygon, 1 if strictly outside it must be strictly convex, otherwise make it strictly convex first

-1 if strictly inside, 0 if on the polygon, 1 if strictly outside

n = total person will kill every kth person, if k = 2, 2,4,6,... returns the mth killed person O(k log n)

Minimum number of knight moves from (x,y) to (0,0) in non-negative infinite chessboard

kth smallest element in [l, r] for array [1,2,1,3,5] 2nd smallest is 1 and 3rd smallest is 2

returns the k-th lexicographically smallest permutation of size n 0-th permutation is the unit permutation i.e. 0, 1, 2, .... n-1

replace update