I just thought that I would share a small piece of internet goodness that I found. It's a nice little webcomic called Tuesday. It's just an archive of a few comics; it wasn't drawn for very long, but they're a very pleasant read.
Sunday, August 31, 2008
Sunday, June 22, 2008
Project euler
Lately I have been trying some of the problems over on Project Euler. It's a list of interesting programming challenges where the (correct) answer is a number. If you input the right number, it will mark down for you that you have solved that one. So far I've only done 11 out of the 199. If you want to try some, I would recommend that you use python as your programming language. It's very good at these sorts of things.
Sunday, May 11, 2008
Sketchup + Kerkythea
Using kerkythea, I made some renderings of some sketchup models. The links are to the 3d warehouse pages where I got the models from.
Shelby Cobra KC 427 Concept
And this
Tuesday, March 18, 2008
Spring is here (photo)
The other day I was taking a walk and saw this tree bud blooming, so I took a few pictures of it. Here's the best one:
Saturday, March 08, 2008
Knex wind turbine
Friday, February 22, 2008
Monday, February 18, 2008
New blog: Go Make
I just created a new blog called Go Make. Over there I'll be gathering projects that I find scattered about the web and showing them to you. Or at least linking to them, which is just as good.
Saturday, February 16, 2008
Google analytics on this blog
Tuesday, January 22, 2008
Selection sort in python
I'm learning python, so I decided to write selection sort in it. I converted the CPP code from 24btes.com. Here's the code (the array at the beginning contains the numbers that will be sorted):
a = [90, 96, 74, 10, 44, 53, 61, 77, 37, 52, 25, 60, 9, 14, 20, 93, 5, 59, 29, 86, 6, 64, 4, 38, 51, 24, 11, 16, 85, 69, 34, 62, 50, 87, 55, 92, 98, 47, 46, 91, 57, 36, 23, 97, 3, 48, 83, 99, 12, 31, 2, 76, 28, 27, 39, 68, 49, 58, 95, 21, 17, 79, 71, 45, 65, 70, 33, 56, 43, 35, 81, 75, 72, 26, 19, 13, 30, 22, 1, 15, 63, 18, 8, 73, 66, 67, 54, 100, 40, 89, 78, 7, 42, 32, 84, 88, 94, 80, 82, 41]
def selSort (array):
i = 0
listLen = len(array)
while i < (listLen - 1):
minat = i
minval= array[i]
j = i + 1
while j < listLen:
if minval> array[j]:
minat = j
minval= array[j]
j = j + 1
temp = array[i]
array[i] = array[minat]
array[minat] = temp
i = i + 1
print array
print listLen
selSort (a)