humbhenri

# Markov Chain Algorithm (The Practice of Programming pg 62)
# set w1 and w2 to be the first two words in the text
# print w1 and w2
# loop:
#   randomly choose w3, one of successors of prefix w1 and w2
#   print w3
#   replace w1 and w2 by w2 and w3
#   repeat loop

import random

humbhenri

package main

import (
	"fmt"
	//"bytes"
	//"strconv"
)

type AVLTree struct {
	Val         int

humbhenri

package main

import (
	"bytes"
	"fmt"
	"strconv"
)

func main() {
	var champernowne bytes.Buffer

humbhenri

package main

import (
	"fmt"
	"math"
)

func main() {
	var champernowne float64
	for n := 1; n <= 10; n++ {

humbhenri

package main

import (
	"encoding/json"
	"flag"
	"fmt"
	"io/ioutil"
	"net/http"
)

humbhenri

(ns get-images.core
  (:require [clojure.tools.cli :refer [parse-opts]]
            [net.cgrand.enlive-html :refer [select html-resource]]
            [clojure.string :refer [split join]]
            [clojure.java.io :refer [input-stream output-stream copy]])
  (:import [java.net URL]
           [java.io File])
  (:gen-class))

(def options

humbhenri

from BeautifulSoup import BeautifulSoup
from functools import partial
from urllib import urlretrieve
from urlparse import urljoin, urlparse
import argparse
import multiprocessing
import os
import sys
import urllib2