I am just finishing off my computer science project, but now I have to do the hard write-up part, and as a matter of fact I am writing this as part of my procrastination of putting that off. I do not like explaining my code to others, as I put effort into making sure that it is self-explanatory. I have built an A* algorithm simulator. I would have added more algorithms but thats not really necessary, but perhaps I will keep working on it after my A-Levels and then I will add more algorithms. For my project I refused to use anything but vanilla JS, so I had to implement a sort of variation of the Fruchterman Reingold algorithm I found a paper on by the university of Brown. I am quite angry now however since it turns out that there is a much more efficient version of the algorithm that can run in O(n) average time, while mine works in O(n^3) time complexity, which I guess doesn't really matter because the simulation is for like max 20 something nodes, but it would have been nice to know, so Brown uni if you are reading this please consider putting that in your paper aswell.
There is sooo many things that is going in my mind right now, and I just can't stop thinking of new ideas of projects to do in the summer so hopefully A-Levels go quickly. But not to quickly because then I won't be able to study and prepare well enough. also I hope it will be warmer so I am not cold anymore that will be pretty nice.
Thank you,
Thank you,
Jean