Still stuck on the same question but by writing out and running the Java code I was able to better understand what was happening. This seems to be a permutations type of algorithm but I still need to do more testing to see if my hypothesis is correct. It feels a bit overwhelming but I have to try my best before I try to give some answer.

TLDR;

Okay, so here are the highlights of what I did:

• Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. Still working on the practice problems. Question eleven is not a joke. While I was going through the example problems I did not become entirely comfortable recognizing and working with algorithms that have factorial runtimes. Currently, my guess is that this algorithm has a runtime that includes a factorial. I could be wrong but that’s what the output is hinting at. The output prints a permutation. I need to do more work on playing with the code but I am getting more comfortable with it. I still suck at writing Java code. It’s those subtle differences between Java and JavaScript that keeps throwing me off. Oh well. It’s a good experience anyways lol.

Conclusion

That’s all for today. If you are interested in the MIT course you can check out the video lecture I’m currently going through. The lecture is helpful but isn’t sufficient by itself. Anyways, until next time PEACE!