Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
LICENSE		LICENSE
README.md		README.md
ball1.py		ball1.py
ball2.cpp		ball2.cpp
ballon3.cpp		ballon3.cpp
multiple thread.cpp		multiple thread.cpp

Repository files navigation

Software-Engineering

About

In a box(2D, 3D) bounded by [-1, 1], given m balloon with variable radio r and position mu, find the optimal value of r and mu which maximize sum r^2. I choose to solve the 2D problem.

project1

Readme

Apache-2.0 license