Course Review: Udacity’s Intro to Algorithms

The last course I took with Udacity, Data Structures and Algorithms, and I completed it satisfactorily. That course was a prerequisite to Udacity’s course, Intro to Algorithms. For personal reasons, I decided to take a break from creating course content myself, so thought it would be a good idea to stay productive and take the next course that is part of Udacity’s Nano Degree program, being Intro to Programming. (And before you ask, no I am not being sponsored by Udacity to make this post.)

As I embark on the next level of self study, I will chronicle what I have learned in the course in this post:-

Lesson 1: A social network magic trick

Lesson 1 presents an introduction to analysis and design of efficient algorithms.

Eulerian Path is a path in a graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex.

Algorithms are cool:-

1. Really useful
2. Really clever

How to make a program fly:-

1. Careful program design
2. Tweak loops
3. Good algorithm design

Importance of mathematics in computer science:-

1. Formalise what you…