Did you know that OSX comes with a VNCviewer? Open up finder and do the Apple magic key and 'k' ... there you go. Oh ... and I guess you need somewhere to connect to. I installed on Xvnc via apt-get on my Ubuntu "workstation" and tada ... I can connect, login and have a … Continue reading Xvnc Magic!
I'm a firm believer that if you're having a problem writing your code, it is because you wrote bad pseudocode. Maybe it didn't have enough detail or a bad layout. Or maybe I ... I mean you ... you just don't know what you are doing. I bring this up because I wasted three hours … Continue reading Project Euler #3 BAD Pseudocode
The Challenge The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? So, this would probably be a good case study in making a basic program and then an optimized one with threading/channels (Is that what Go calls them?) Maybe a good time … Continue reading Project Euler #3 Pseudocode
On more Project Euler problems, or learning some CD/CI stuff, or maybe writing more tests ... instead, I'm just channel surfing on YouTube
In all seven languages in one night! Hell yeah! I still don't have enough data in Gitlab to start crutching some analytics though. In other news I caught with the Game Dev Quest podcast. I found it very motivational and like they say, "If they can do it, so can you." I think I'm going … Continue reading Finished up Euler #2 in ???
The Challenge Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, … Continue reading Project Euler #2 Pseudocode