A (not-so-subtle) continuation on Coells' 100 days (https://github.com/coells/100days). Coells focused on fundamental algorithms in his repo. This one is split between fundamental and more involved algorithms, and so some of these will take more than a single day to implement.
Here are some of the algorithms I want to implement (categorized working list). Note that for different categories, I'll take different implementations for granted (i.e. in RANSAC, I'll assume we have a linear regression implementation). These are roughly listed in order of difficulty within a category:
- RANSAC
- Conway's Game of Life
- FFT
- QR Algorithm
- GMM (EM)
- Chien search
- Convex hull
- A*
- Logistic regression
- Decision tree
- Decision forest
- Spectral embedding
- PCA
- LDA
- Adaboost
- SVM
- Delaunay triangulation
- Voronoi diagram
- ORB
- Stereo depth estimation
- SLAM