The Creative Edge
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