http://www.intma.in/wiki/ 2010-09-08T15:45:28-04:00 http://www.intma.in/wiki/ http://www.intma.in/wiki/lib/images/favicon.ico text/html 2010-02-14T16:37:06-04:00 http://www.intma.in/wiki/bmp?rev=1266183426&do=diff Answer To:<http://forum.codecall.net/c-c/23108-need-do-some-simple-image-analysis.html#post225689> It's highly recommend you read the last part of the wikipedia article on the BMP file format (or all of it) to learn how to extract pixel information. text/html 2009-10-15T23:49:59-04:00 http://www.intma.in/wiki/d2b?rev=1255664999&do=diff The easiest and most straightforward approach to converting from decimal to binary is using a stack, dividing the number by two until its equal to zero and storing the remainder. C #include <stdio.h> #include <stdlib.h> typedef struct stack_node { signed char value; struct stack_node *prev; } stack_node_t; void stack_push(stack_node_t **node, signed char value) { stack_node_t *temp = NULL; temp = (stack_node_t*)malloc(sizeof(stack_node_t)); temp->value = v… text/html 2009-10-06T02:24:46-04:00 http://www.intma.in/wiki/huffman_coding?rev=1254810286&do=diff I'm not going to bother with a large prelude or a massive amount of theory; read the wikipedia article. Instead I'm going to cover the basics and just enough to get a working implementation in C. Frequency-sorted binary tree A binary tree is simply a tree where each node has at most two children, 0 or 1. text/html 2009-12-19T10:38:35-04:00 http://www.intma.in/wiki/linked_lists?rev=1261237115&do=diff Linked lists are one of the most basic data structures you'll ever encounter in computer programming. Its often the base for many other common structures, like queues and stacks. Linked lists (of varying type) can come in two forms, linear, like so: text/html 2010-01-09T15:43:48-04:00 http://www.intma.in/wiki/morse?rev=1263069828&do=diff Answer To: <http://forum.codecall.net/c-c/23032-recursion-binarytree-morsecode.html> This is a very nasty example, and I blame it on the time (3:19 AM). Try handing this in your teacher will laugh at you. You'll probably want to extend the table as well, I've only done a-z. text/html 2009-12-14T00:26:20-04:00 http://www.intma.in/wiki/palindrome?rev=1260768380&do=diff Answer to: <http://forum.codecall.net/c-c/22050-palindrome-anyone.html> Determining if a string is a palindrome is a common beginner computer sciences question. For some reason, the majority of the answers I see involve creating a reversed copy of the string and comparing them. A faster, straightforward approach is to use two pointers, one from the head (or beginning) of the string and another from the tail (or end) of the string. text/html 2009-12-15T23:37:23-04:00 http://www.intma.in/wiki/pointers?rev=1260938243&do=diff If you are new to C or C++ programming, you may be perplexed by your first encounter with a pointer. What is it good for, how do I use them in my own programs, and what do they actually do? These things aren't always easy to understand, but this tutorial will shed some light on the subject. text/html 2009-12-14T00:15:55-04:00 http://www.intma.in/wiki/raw?rev=1260767755&do=diff Answer To: [23:49:44] <john> in c, is it possible to read character by character rather than line by line? :!: Everything described here only applies to unix's (OS X, Linux, Solaris, ect...) For Windows see ReadConsoleInput() on MSDN. Often, when one is making a console application you don't want to wait for [enter] to get input; rather, you want to get each and every character as its typed. The default mode (called canonical mode) sees input as lines - it will wait to act until the line is fi… text/html 2010-02-14T18:16:05-04:00 http://www.intma.in/wiki/server_level?rev=1266189365&do=diff :!: Warning: Minecraft is an alpha product, ever changing and ever improving. I've given up trying to keep up, and will only update this page again after its finally released. Maps for MineCraft are stored in a file called server_level.dat within the main server directory. The format of the file varies, but all versions (so far) follow the same layout. text/html 2010-02-11T13:54:32-04:00 http://www.intma.in/wiki/sieve_eratosthenes?rev=1265914472&do=diff A simple implementation of the Sieve of Eratosthenes, a simple, ancient algorithm for finding all prime numbers up to a specified integer. More information can be found on wikipedia, here. We use a bit array to efficiently store the state of each number. If a number is 0, its a prime. If a number is 1, it isn't. Simple, no? As an example, after the sieve runs, prime[0] will look like this: text/html 2010-07-12T11:13:25-04:00 http://www.intma.in/wiki/start?rev=1278947605&do=diff This site is still under construction by a team of secret mad scientists. LOL You can usually find them in their evil lair: irc.podnet.org:6667 #intmain. The intma.in forum is here. * Pointers (C,CPP) * Function Pointers (CPP) * Directory Access (C) * Basic Process Creation and Communication (C) text/html 2010-01-09T15:43:49-04:00 http://www.intma.in/wiki/strtol?rev=1263069829&do=diff Answer To: <http://forum.codecall.net/c-c/22551-question-about-arrays-counters.html> #include <stdio.h> #include <stdlib.h> int main(const int argc, const char* argv[]){ int i; char *ep; for(i = 1; i < argc; i++){ if(!strtol(argv[i],&ep,10)){ printf("Error %s.\n",argv[i]); }else{ printf("Integer %s.\n",argv[i]); } } } text/html 2009-11-06T13:43:25-04:00 http://www.intma.in/wiki/tornado?rev=1257533005&do=diff Answer To: <http://forum.codecall.net/c-c/22309-sorting-problem.html> /* Example program for http://forum.codecall.net/c-c/22309-sorting-problem.html */ #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct ef { unsigned int year; int ef[6]; } ef_t; int main(int argc, const char **argv) { /* This is called a conditional expression. Re-written, it would be: if(argc > 1) fname_t = argv[1]; else fname_t = "t-scale.…