darklight721

atom.commands.add 'atom-text-editor',
  'easy-semicolon:end-line': (event) ->
    editor = @getModel()
    editor.moveToEndOfLine()
    editor.insertText(';')

darklight721

/*
 * jquery.tablesorter.js - a small table sorter jquery plugin
 * Usage:
 *   $('table').tablesorter();
 * Options:
 *   $('table').tablesorter({
 *     defaultSort: [0, 1] // initial sort - [<column index>, <1 (ascending) || -1 (descending)>]
 *   });
 * Action Triggers:
 *   $('table').trigger('update');       // to update the table when there are changes like addition/removal of <tr>/<td>

darklight721

# Open up your atom's init script file and add the following lines, then restart atom.

path = require 'path'

endLine = (insertNewLine) ->
  editor = atom.workspace.activePaneItem
  if path.extname(editor.getPath()) is '.js'
    editor.getCursors().forEach((cursor) ->
      editor.moveCursorToEndOfLine()
      line = cursor.getCurrentBufferLine().trim()

darklight721

/*
 * d8s.js - a simple js date formatter
 * Usage:
 *  d8s().print('MM-DD-YY hh:mm:ss');                        // outputs: 07-21-13 10:25:01
 *  d8s('2013/7/21' ,'YYYY/M/D').print('DDD of MMMM, YYYY'); // outputs: 21st of July, 2013
 *  d8s('Sep. 5, 2013 13:30', 'MMM. D, YYYY HH:mm').date();  // returns the Date object with the set date
 *  d8s(new Date(1995,11,17)).print('DD.MM.YYYY');           // outputs: 17.11.1995
*/

window.d8s = window.d8s || (function(){

darklight721

void quick_sort(int list[], int left, int right)
{
	if (left < right) {
		int pivot = (left + right) / 2; // left + (right - left) / 2 is safer to use for large lists
		pivot = partition(list, left, right, pivot);
		quick_sort(list, left, pivot - 1);
		quick_sort(list, pivot + 1, right);
	}
}

darklight721

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

int ** makeGrid(int size, int *startX, int *startY, int *endX, int *endY)
{
    // allocate memory for the grid
    int **grid = (int**)malloc(sizeof(int*) * size);
    int x, y;
    for (x = 0; x < size; x++) {
        grid[x] = (int*)malloc(sizeof(int) * size);

darklight721

void insertion_sort(int list[], int size)
{
	int i, j, insertVal;
	
	for (i = 1; i < size; i++) {
		insertVal = list[i];
		for (j = i; j > 0 && insertVal < list[j - 1]; j--) {
			list[j] = list[j - 1];
		}
		list[j] = insertVal;