Aircraft Battle Game implemented with STM32F103RC
-
Updated
Jan 1, 2020 - C
#
cs301
Here are 8 public repositories matching this topic...
Empirical comparison of an exact Θ(n·2ⁿ) brute force vs. a Θ(n log n) modified greedy heuristic (provable 1/2-approximation) on the Subset Sum problem. Brute force fits 1.868ⁿ with R²=0.9955; heuristic achieves 0.9848 mean quality ratio.
python algorithms jupyter-notebook np-complete greedy-algorithm complexity-analysis subset-sum brute-force-algorithm sabanci-university cs301 approximation-algorithm empirical-analysis
-
Updated
May 18, 2026 - Jupyter Notebook
distributed-systems algorithms operating-system data-structures cs network-security homeworks sabanci-university cs204 cs301 cs300 cs201 cs307 cs432 cs403
-
Updated
Jan 18, 2024 - C++
Add this topic to your repo
To associate your repository with the cs301 topic, visit your repo's landing page and select "manage topics."