Fred Nora frednora

Memory Optimization (Christer Ericson, GDC 2003)
http://realtimecollisiondetection.net/pubs/GDC03_Ericson_Memory_Optimization.ppt

Cache coherency primer (Fabian Giesen)
https://fgiesen.wordpress.com/2014/07/07/cache-coherency/

Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

BrainFuck Programming Tutorial by: Katie

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

INTRODUCTION

Side scrolling in GameMaker can be implemented with little effort. In this episode we take a step back from 2014 and take a look at how a 2d side scrolling games were implemented 20 years ago. Due to limited hardware, developers had to use smart memory management techniques to create the games that they wanted. In the 80s the best games were being made for consoles like the NES since they could support memory on the game card. In the early 1980s the standard graphics card for PCs; the CGA was not capable of even creating a satisfying 2d side scrolling effect. The Color/Graphics Adapter was IBM's first graphics card with a max resolution of 640×200, and support for 16 colors, and 16 kilobytes of video memory.

For a more more details on the CGA read on here.

This card did not have the capabilities to create the smooth side scrolling effect that NES and

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

	#include <stdlib.h>
	#include <unistd.h>
	#include <stdio.h>
	#include <sys/msg.h>
	#include <sys/wait.h>
	#include <string.h>

	/* message structure */
	struct message {
	long mtype;

	/*
	Packet sniffer using libpcap library
	*/
	#include<pcap.h>
	#include<stdio.h>
	#include<stdlib.h> // for exit()
	#include<string.h> //for memset

	#include<sys/socket.h>
	#include<arpa/inet.h> // for inet_ntoa()

	/* www.GeeksBR.com */

	/* Implementação de árvore binária */

	#include <stdio.h>
	#include <stdlib.h>

	/* Cada nó armazena três informações:
	nesse caso um número (num),
	ponteiro para subárvore à direita (sad)

	/*
	Implementação de uma fila com arranjo circular
	Autor: Marcos Castro - www.GeeksBR.com
	*/

	#include <stdio.h>
	#define MAX 5 // máximo de elementos

	// dois índices apontando para início e fim da fila
	// inicialmente esses índices são iguais a 1

	/*
	Copyright 2001, 2002 Georges Menie (www.menie.org)
	stdarg version contributed by Christian Ettinger

	This program is free software; you can redistribute it and/or modify
	it under the terms of the GNU Lesser General Public License as published by
	the Free Software Foundation; either version 2 of the License, or
	(at your option) any later version.

	This program is distributed in the hope that it will be useful,

	int apply(int (*func)(int), int x) {
	return func(x);
	}