bert

Some possible implementations of the Bresenham Algorithms in C.

The Bresenham line algorithm is an algorithm which determines which points in an
n-dimensional raster should be plotted in order to form a close approximation
to a straight line between two given points.
It is commonly used to draw lines on a computer screen, as it uses only integer
addition, subtraction and bit shifting, all of which are very cheap operations
in standard computer architectures.
It is one of the earliest algorithms developed in the field of computer graphics.
A minor extension to the original algorithm also deals with drawing circles.

scottjehl

// First, let's define a widget/plugin called "foo"

// Either using jQuery's $.fn plugin namespace, for simple stateless plugins...
$.fn.foo = function(){

  // In this scope, this refers to the element on which the plugin foo() was called 
  // manipulate it and return this at the end, so it can be chainable

};

skorks

require 'terminal-table/import'

class SubsetSumMatrix
  class << self
    def create_empty_for(array)
      matrix = []
      header = [nil] + build_header_from(array)
      matrix << header
      array.each_with_index do |element,i|
        row = header.collect{|value| 'F'}