go-algorithms

algorithm implementation using go

Parking lot

• To be filled in

D&C

• To be filled in

Dynamic

• Egg drop problem

Pareto optimal

• Closest pair of points
  • Given n points on a two-dimensional plane, find the pir of points such tha the distances between them is smaller than any other pair of points
  • can be solved in O(n log n) time