It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

A theory posits that the all of our thoughts are a function of a basic algorithm, N=2^i–1. This development may be huge for AI, since artificial neural networks operate much like the brain ...

View on Coursera Course Decription This course introduces number-theory based cryptography, basics of quantum algorithms and advanced data-structures. Learning Outcomes Understand how basic ...