sagivo

var settings = {network: 'live'};
var acceptBitcoin = require('accept-bitcoin');
ac = new acceptBitcoin('YOUR_BITCOIN_ADDRESS', settings);
//generate new key for transaction
key = ac.generateAddress({alertWhenHasBalance: true});
console.log("Hello buyer! please pay to: " + key.address());
key.on('hasBalance', function(amount){
  console.log("thanks for paying me " + amount); //do stuff
  //transfer the amount recived to your account
  key.transferBalanceToMyAccount(function(err, d){

sagivo

def perm arr, i=0
  return p arr if i == arr.size
  (i..arr.size-1).each do |j|
    arr[i], arr[j] = arr[j], arr[i]
    perm arr, i+1
    arr[i], arr[j] = arr[j], arr[i]
  end
end

perm 'ABC'

sagivo

byte-size tuts

by alexander white ©

golang tutorials

• 0 - installation on a Mac
• 1 - packages
• 2 - remote packages
• 3 - variable syntax
• 4 - functions syntax
• 5 - loops syntax

sagivo

byte-size tuts

by alexander white ©

golang tutorials

• 0 - installation on a Mac
• 1 - packages
• 2 - remote packages
• 3 - variable syntax
• 4 - functions syntax
• 5 - loops syntax

sagivo

import "sort"

func main() {
  arr := []int{2,4,3,1}
  sort.Ints(arr)
  fmt.Println(arr) // => [1,2,3,4]
}

sagivo

$ go test -bench=. -cpu 4 -benchtime 10s mergesort_test.go
testing: warning: no tests to run
PASS
BenchmarkMSAsync-4	      10	1450210929 ns/op
ok  	command-line-arguments	20.887s

$ go test -bench=. -cpu 4 -benchtime 10s quicksort_test.go
testing: warning: no tests to run
PASS
BenchmarkQS-4	       5	2101334470 ns/op

sagivo

func mergeSortAsync(l []int, c chan []int) {
  if len(l) < 2 {
    c <- l
    return
  }
  mid := len(l) / 2  
  c1 := make(chan []int, 1)
  c2 := make(chan []int, 1)
  go mergeSortAsync(l[:mid], c1)
  go mergeSortAsync(l[mid:], c2)

sagivo

$ go test -bench=. -benchtime 10s mergesort_test.go
testing: warning: no tests to run
PASS
BenchmarkMSAsync	       1	88944871528 ns/op
ok  	command-line-arguments	92.272s

sagivo

func merge_sort_async(l []int, c chan []int) {
  if len(l) < 2 {
    c <- l
    return
  }
  if len(l) < 500 { //TUNE THIS NUMER AND DONT CREATE EXTRA WORK UNLESS IT'S BIGGER 
    c <- merge_sort(l)
    return
  }
  mid := len(l) / 2

sagivo

#include <node.h>

namespace demo {
  using v8::FunctionCallbackInfo;
  using v8::Isolate;
  using v8::Local;
  using v8::Object;
  using v8::String;
  using v8::Value;