egonSchiele

If you have already taken a course in algorithms, why read Grokking Algorithms (manning.com/bhargava)?

If you were learning graph algorithms, which approach would you prefer:

1. Imagine you have to take public transit from your home to your office. How do you figure out the fastest route? Use graph algorithms! OR

2. We can choose between two standard ways to represent a graph G = (V, E): as a collection of adjacency lists or as an adjacency matrix. Either way applies to both directed and undirected graphs.

I prefer the first way: lead with lots of examples, and clear writing. The second way is an excerpt from "Introduction to Algorithms"...that's how they start their section on graph algorithms.

egonSchiele

Notes on cameras

Lenses

Focal length

Prime (fixed) lens

If it says 17mm, it's fixed at that...you can't zoom in or out. Advantages: cheaper.

egonSchiele

#!/usr/bin/env ruby
require 'tempfile'

def make_row cols, style=""
  "<tr style='#{style}'><td>" + cols.join("</td><td>") + "</td></tr>"
end

if ARGV.empty?
  puts %{
Usage: #{$0} [file] where file has col list for a hive table, then a blank line, then some sample rows

egonSchiele

def generate_valid_isbn
  prefix = 978.to_s # must be 978 or 979
  registration_group_element = rand(10).to_s
  registrant_element = (rand(90000) + 10000).to_s
  publication_element = (rand(900) + 100).to_s
  _isbn = prefix + registration_group_element + registrant_element + publication_element
  check_digit = 0
  i = 0
  _isbn.each_char do |letter|
    i+= 1

egonSchiele

 trap("SIGINT") do
   puts "goodbye!"
   # exit
 end

 while true
 end

egonSchiele

import Control.Applicative
import Github.Gists
import Github.Users.Followers
import System.Directory
import Control.Monad
import qualified Data.Set as S
import Text.Printf
import System.Process
import System.IO.Unsafe

egonSchiele

import Control.Concurrent
import System.Process
import System.Environment

say str = system $ "say '" ++ str ++ "'"

timer :: Int -> IO ()
timer 1 = do
    say "one minute left! oh crap!"
    threadDelay $ 30 * 1000 * 1000

egonSchiele

{-# LANGUAGE TemplateHaskell #-}

import Control.Lens

data Point = Point {
           _x :: Double,
           _y :: Double
           } deriving (Show)

data Mario = Mario { _location :: Point } deriving (Show)

egonSchiele

#!/usr/bin/env ruby

_import = $stdin.gets
import = _import.chomp.gsub("import", "").gsub("qualified", "").gsub(/as .*/, "")
cmd = "hoogle -i '#{import}'"
puts cmd
packages = `#{cmd}`
lines = packages.split("\n")

package = lines.find do |line|

egonSchiele

import Control.Monad.Reader

hello :: Reader String String
hello = do
    name <- ask
    return ("hello, " ++ name ++ "!")

bye :: Reader String String
bye = do
    name <- ask