Friday, January 21, 2022

Day 1: CLRS Chapter 1

Read Chapter 1 today. Pretty straightforward, talks about general introduction to algorithms and how an algorithm which takes n log n operations is far superior than one which takes n^2, gives example of insertion sort vs merge sort.

No comments:

Post a Comment