|
|
|
|
|
by sleepdev
5729 days ago
|
|
Good point. Memoization is a one off that I also find myself using quite regularly. "Coolest" algo I've ever developed would have to be parser combinators. Coolest graph algorithm: finding maximal cliques and independent sets + approximation algorithms for these. |
|