Presentation on a use case of memoization. Uses an inefficient function for finding ordinal prime numbers. Exemplifies quadratic time complexity and time savings from memoization. Presenter should uncomment each section and run code in a Javascript environment while explaining concept.