January 2011
54 posts
mayaindian asked: hhaha nästan så jag ska deeet men det känns ovärt hahaha före är helgg
mayaindian asked: haha jag är trööööööött :(
mayaindian asked: hoho älskar att a:et kom utanför !!!!! haha<3
mayaindian asked: hej gusti!!!11<3
THE SHIT →
If you took off your mask, would people recognise...
WatchGive me 11.11.11 now.
7 tags
Happy Birthday! + Prime number - tester, TI-BASIC
Yup, it’s ma birthday today :3 Kinda awesome!
OK, I’m really sorry, you prolly don’t want me 2 post my new codes :( But since it’s my birthday I’ll do it anyway! ^_^
Jowl and I made a program to test if a number is a prime number or not! This’ll save you some time instead of listing all the prime numbers and looking for your number. With our original codes...
4 tags
Die, TI-BASIC
I’m currently in a crazy programming phase, just can’t stop thinking/talking about it lol :(
I found my old die(not TO die, A die) program in my calculator! I sat down and optimized it while cooking for me and mom, lawl The original code was longer than the new, but easier to understand so I’ll post ‘em both!
Original source code: :ClrHome :rand->H //This creates a...
7 tags
Prime numbers, TI-BASIC
Sieve of Erathostenes The Sieve of Erathostenes is an algorithm used to generate all prime numbers within the interval [2, N] where N is the upper limit, a specified integer set by the user.
This is how it works: Count all the numbers in the interval [2, 20] 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20 The first number in this interval(2), remove all the multiples of 2...
5 tags
Binary converter, TI-BASIC
Yesterday, I made this program in my TI-84 Plus calculator. Spent some time coming up with this algorithm, got frustrated(like any programmer would) but when I finally got to the breaking point I just felt: OH JOY! Really easy to understand, fast and small! None of that Debian 5.0 with 300M SLOC, crazy fuckers.
I added comments to make it easier to understand. Here’s the source code:
...
