http://notsocomplexanalysis.wordpress.com/
Going to be fully set up within the next ~30 minutes.
Friday, 4 November 2011
Thursday, 3 November 2011
On NaNoWriMo and other things.
As some of us may know, November is National Novel Writing Month. In this time, people from all walks of life devote the month of November for thirty days of literary work. Unlikely enough, I'm taking the plunge: I'm going to write a novel within the space of this month (and I'm already sort of procrastinating by blogging about it).
Before I go into details about my planned plot, let me take some time to write about how I'm not very oriented to fictional literature. Indeed, I already have a friend who always pesters me about how I never read fiction (if you're reading this, friend, thank you for everything; wow, you just read it whilst sitting next to me at school).
Project Euler 154: Update!
I'm actually in the middle of my day right now, but I was able to get help from a friend (beary605 on wherever he's signed up) and finally code the Pascal's pyramid layer generator!
Busy right now, will update later. Project 154 -still- not solved, but progress has been made.
Busy right now, will update later. Project 154 -still- not solved, but progress has been made.
Wednesday, 2 November 2011
Dead Aid: The Formal Summary/Uninformed Review (First Edit)
In my first post I pointed out how I just finished the book "Dead Aid", a book that presents a compelling argument about the current situation in Africa. Today I was able to draft a formal summary of the book, as well as a small appendix of my own thoughts.
Without further ado:
DEAD AID: Summary and Thoughts
Without further ado:
DEAD AID: Summary and Thoughts
Some old coding projects: Hangman, Age Sorter
I'm currently in InfoTech class right now, so I guess I'll share some assignments that I finished early, and some that I pursued by myself.
The first of these is a simple hangman variation, which covers many of the first-term topics that we've learned so far (and actually a few that have yet to be taught to the rest of the class).
The second of these is an age-sorting program (oldest-to-youngest). It's quite simple, and it was the first time I've ever had to define functions within defined functions. The only reason why it's so long is because I had to do it in the DDMMYYYY format, and had to tell the user that they had inputted an invalidly formatted date if they entered something, like, say, 32011001. I'll try to see if I can change the global declarations. I haven't revisited this in a -while- though, and since then I've started other projects. The main challenge here was to do this without importing the time module.
The first of these is a simple hangman variation, which covers many of the first-term topics that we've learned so far (and actually a few that have yet to be taught to the rest of the class).
The second of these is an age-sorting program (oldest-to-youngest). It's quite simple, and it was the first time I've ever had to define functions within defined functions. The only reason why it's so long is because I had to do it in the DDMMYYYY format, and had to tell the user that they had inputted an invalidly formatted date if they entered something, like, say, 32011001. I'll try to see if I can change the global declarations. I haven't revisited this in a -while- though, and since then I've started other projects. The main challenge here was to do this without importing the time module.
A slight amendment to the code I posted yesterday.
I realize that yesterday, although the code I posted worked, it was rather arbitrary and stuff. Here's the amended code.
Well, I'm eating lunch right now, so nothing important happened yet.
Well, I'm eating lunch right now, so nothing important happened yet.
Tuesday, 1 November 2011
Coding for today -- Nov 1, 2011
My project over the next day or so includes but is not limited to Project Euler 154.
While I wasn't able to solve it just yet, I was able to put together a simple Pascal's triangle generator in Python. I currently use Python 2.7.
It's pretty simple if you already know about how Pascal's triangle is really a table for binomial coefficients (n choose k).
While I wasn't able to solve it just yet, I was able to put together a simple Pascal's triangle generator in Python. I currently use Python 2.7.
It's pretty simple if you already know about how Pascal's triangle is really a table for binomial coefficients (n choose k).
Subscribe to:
Posts (Atom)