Jonathan Pepin Jauny

#Sorting a Hash I wanted to understand what happened under the hood when something like

hash.sort { |a, b| b[1] <=> a[1] }

is called. If you can't answer, you might want to read.
I'll be as basic as possible (I don't know much anyway...) so it should be understandable.

First let's begin by saying that we will be working on this hash

#Understanding blocks, Procs and lambdas. I think blocks, Procs and lambdas are working in a really counter-intuitive way when you
first try to understand how they work, and most of the (amazing) resources one can find online
are too complicated to allow to understand how they work without frustration...

So here is my take on it; I'll try to make it as simple and concise as possible,
and will focus on how it is used, instead of how it works under the hood.

##Blocks A block is simply a piece of code that will (usually) execute something;

	//Solution à l'interview de Facebook
	//Edmond La Chance UQAC 2012
	//02:10 2012-05-24
	//Énoncé : http://pastebin.com/4FNndtNV


	#include <iostream>
	#include <fstream>
	#include <string.h>
	using namespace std;

	This is a modified version of Eric Martin's Simplemodal jQuery popup to allow you to easily add multiple links/popups on the same page.
	http://www.ericmmartin.com/projects/simplemodal/

	I am a noob and had trouble finding material on how to do that... so here is my version :)

	Thanks to Eric Martin for making that amazing jQuery function,
	Thanks to Alex, a friend, to help me with his magic to make everything work!

	Cheers!

	def mode(array)
	h = Hash.new
	array.uniq.each do \|x\|
	h[x] = array.count(x)
	end
	h.select{\|k,v\| v == h.values.max }.map{\|i\| i[0] }
	end

	.hidden {
	display: hidden;
	}

	.normal:hover .hidden {
	display: block;
	}

	-> a = []
	=> []
	-> a << a
	=> [[...]]
	-> a.first == a
	=> true

	nodes = { a:[], b:[], c:[], d:[] }
	nodes[:a] << nodes[:a]
	nodes[:a] << nodes[:b]
	nodes[:b] << nodes[:a]
	nodes[:b] << nodes[:c]
	p nodes
	#=> {:a=>[[[...], []], [...]], :b=>[[[...], [...]], []], :c=>[], :d=>[]}

	def increment(x, y)
	n = 1
	while n < x
	puts n
	n += y
	end
	end

	// with option to choose from where it starts