andlima

Table of Contents

• 1. Princípios de Modelagem Preditiva
• 2. Geral
  • 2.1. "Todos os modelos são errados; alguns são úteis"
  • 2.2. Tenha clareza sobre as premissas do modelo
  2.3. Considere o trade-off acurácia vs interpretabilidade

andlima

andlima

fn initialize_generator(mt: &mut [uint], index: &mut uint, seed: uint)
{
    mt[0] = seed;
    *index = 0;

    for i in range(1, 624) {
        mt[i] = (
            (
                1812433253 * (mt[i-1] ^ (mt[i-1] >> 30))
            ) + i

andlima

from __future__ import print_function


class Trie(object):
    '''Implementation of a trie.'''

    def __init__(self, collection=None):
        self.ends = False
        self.children = {}
        if collection is not None:

andlima

from bisect import bisect_left, bisect_right


def solve(numbers, a, b):
    answer = bisect_right(numbers, b) - bisect_left(numbers, a)
    return answer if answer > 0 else 0

def main():
    numbers = [1, 4, 9]
    previous = ('012', [''])

andlima

def distance(points, i, j):
    x1, y1 = points[i]
    x2, y2 = points[j]
    return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5

def find_root(height_and_parent, i):
    hi, pi = height_and_parent[i]
    if pi is None:
        return i
    return find_root(height_and_parent, pi)

andlima

def distance(points, i, j):
    x1, y1 = points[i]
    x2, y2 = points[j]
    return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5

def merge_root(root, i, j):
    good, bad = sorted([root[i], root[j]])
    bad_keys = [k for k, v in root.iteritems() if v == bad]
    for key in bad_keys:
        root[key] = good

andlima

"""

A short script that, given an artist, scrapes all his/her/their songs
from 'http://letras.terra.com.br'

Dependence: BeautifulSoup, to parse the lyrics from each song page.

Author: Andre Lima - http://github.com/andlima

Licensed under MIT License

andlima

int quick_find_kth(int *v, int n, int k) {
    if (n == 1 && k == 0) return v[0];

    int pivot = v[n-1];

    int store = 0;
    for (int i=0; i<n-1; i++) {
        if (v[i] < pivot) {
            swap(v[i], v[store++]);
        }

andlima

int find_kth(int *v, int n, int k) {
    if (n == 1 && k == 0) return v[0];

    int m = (n + 4)/5;
    int *medians = new int[m];
    for (int i=0; i<m; i++) {
        if (5*i + 4 < n) {
            int *w = v + 5*i;
            for (int j0=0; j0<3; j0++) {
                int jmin = j0;