Skip to content

Instantly share code, notes, and snippets.

View ackintosh's full-sized avatar
🎯
Focusing

Akihito Nakano ackintosh

🎯
Focusing
View GitHub Profile
@ackintosh
ackintosh / trie.rb
Created December 15, 2013 04:30
Trie tree implementation in Ruby.
class Node
attr_reader :data, :children
attr_accessor :term
def initialize(data)
@data = data
@children = []
@term = false
end
def insert(char)
@ackintosh
ackintosh / vb.rb
Created December 3, 2013 14:49
VBCode in Ruby.
class Fixnum
def encode
n = self
bytes = []
loop do
bytes.unshift n % 128
break if n < 128
n = n / 128
end
bytes[-1] += 128
<?php
class Foo
{
public function bar()
{
// ...
$posts = get_posts($condition);
if ( !is_array($posts) ){
return;
}
@ackintosh
ackintosh / 1.php
Last active December 25, 2015 19:09
<?php
class Something
{
public function receiveData($data)
{
// do something.
mail($to, $subject, $message);
// do something.
@ackintosh
ackintosh / 1.php
Created August 25, 2013 07:49
Late Static Binding
<?php
abstract class Car
{
protected static $price;
public static function getFormattedPrice()
{
return number_format(self::$price);
}
}
require 'pry'
require 'test/unit'
class String
def ll_quiz
input = self.dup
output = ''
input.split("\n").each do |line|
target, strings = line.split(' ')
@ackintosh
ackintosh / gist:6261240
Created August 18, 2013 11:38
#gunmacs QuickSort
require 'pry'
require 'test/unit'
class Array
def quick_sort
ary = self.dup
return ary if size <= 1
left, right = ary.partition_by_pivot_index(ary.pivot_index)
left.quick_sort + right.quick_sort
@ackintosh
ackintosh / gist:6260447
Last active December 21, 2015 05:58
#gunmacs MergeSort
require 'pry'
require 'test/unit'
class Array
def merge_sort
ary = self.dup
return ary if size <= 1
mid = size / 2
left = ary[0, mid]
@ackintosh
ackintosh / gist:6260311
Created August 18, 2013 07:04
#gunmacs InsertionSort
require 'pry'
require 'test/unit'
class Array
def insertion_sort
ary = self.dup
(1...size).each do |i|
(i).downto(1) do |j|
ary[j], ary[j - 1] = ary[j - 1], ary[j] if ary[j] < ary[j - 1]
@ackintosh
ackintosh / gist:6260245
Created August 18, 2013 06:41
#gunmacs SelectionSort
require 'pry'
require 'test/unit'
class Array
def selection_sort
ary = self.dup
(0...size).each do |i|
min_index = i
((i + 1)...size).each do |j|