Kevince prikevs

## skip_list.c
/* Skip Lists: A Probabilistic Alternative to Balanced Trees */

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

#define SKIPLIST_MAX_LEVEL 6

typedef struct snode {
    int key;

## background.js
// this is the background code...

// listen for our browerAction to be clicked
chrome.browserAction.onClicked.addListener(function (tab) {
	// for the current tab, inject the "inject.js" file & execute it
	chrome.tabs.executeScript(tab.ib, {
		file: 'inject.js'
	});
});
	/* Skip Lists: A Probabilistic Alternative to Balanced Trees */

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

	#define SKIPLIST_MAX_LEVEL 6

	typedef struct snode {
	int key;
	// this is the background code...

	// listen for our browerAction to be clicked
	chrome.browserAction.onClicked.addListener(function (tab) {
	// for the current tab, inject the "inject.js" file & execute it
	chrome.tabs.executeScript(tab.ib, {
	file: 'inject.js'
	});
	});