Author: Unknown
Subject: Writing efficient algorithms
Date: Monday, 30 Mar 2020, 14:25:52

I find myself struggling at times to write efficient code/come up with efficient algorithms. For example, when I completed the sample midterm on my own for the the first time, I was able to come up with a solution for problem 5 that met the 2/3 credit requirement, but after that I hit a brick wall. When you explained the algorithm that met the full credit requirement in class, it made perfect sense to me and I could come up with it now, but I don't know if I could have ever figured that out on my own without some guidance. On the current problem set, I found it pretty easy to meet the 4*#compares + N requirement, but I have also hit a wall here with finding a solution that meets the 2*#compares + N requirement.

It's frustrating for me because I really want to get better at solving problems like these on my own the first time without any guidance. I realize that this is a pretty general question, but do you have any suggested resources for getting better at this kind of thing (advice, books, etc.)?