Steven Schmatz stevenschmatz

## gen_fibonacci_plots.py
from time import time
from typing import List
import numpy as np
from scipy.optimize import curve_fit
import matplotlib.pyplot as plt


def fibonacci_naive(n: int) -> int:
    if n <= 2: return 1
    return fibonacci_naive(n-1) + fibonacci_naive(n-2)

## debugprint.py
def print_value_function(v):
    for i in range(4):
        for j in range(4):
            print("%.3f" % v[i*4 + j], end=' ')
        print()


def print_policy(policy):
    characters = ['←', '↓', '→', '↑']
    for i in range(4):

## sieve.py
from collections import OrderedDict

def sieve_of_eratosthenes(n):
    """Generates primes up to n, inclusive."""

    candidates = OrderedDict((i, None) for i in range(2, n + 1))
    primes = []

    while len(candidates) > 0:
        prime = list(candidates.keys())[0]

## lab.cpp
#include <iostream>
#include <exception>
#include <stdlib.h>

using namespace std;

/*
 *  Your tasks:
 * - Fill in missing pieces in the code
 * - Fix any bugs in the program

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                stevenschmatz
                / keybase.md
            
            
              Created
              October 28, 2014 15:03
            
          
    Keybase proof

I hereby claim:

I am stevenschmatz on github.
I am stevenschmatz (https://keybase.io/stevenschmatz) on keybase.
I have a public key whose fingerprint is EF13 AC76 A87C 097E 44F6  01EC 9FCA 2E6B 7D86 BEDE

To claim this, I am signing this object:

  
## index.html
<!DOCTYPE html>
<html>
<head lang="en">
    <meta charset="UTF-8">
    <title>Helping Shane</title>
</head>
<body>
<script>

var calculateError = function(length) {
	from time import time
	from typing import List
	import numpy as np
	from scipy.optimize import curve_fit
	import matplotlib.pyplot as plt


	def fibonacci_naive(n: int) -> int:
	if n <= 2: return 1
	return fibonacci_naive(n-1) + fibonacci_naive(n-2)
	def print_value_function(v):
	for i in range(4):
	for j in range(4):
	print("%.3f" % v[i*4 + j], end=' ')
	print()


	def print_policy(policy):
	characters = ['←', '↓', '→', '↑']
	for i in range(4):
	from collections import OrderedDict

	def sieve_of_eratosthenes(n):
	"""Generates primes up to n, inclusive."""

	candidates = OrderedDict((i, None) for i in range(2, n + 1))
	primes = []

	while len(candidates) > 0:
	prime = list(candidates.keys())[0]
	#include <iostream>
	#include <exception>
	#include <stdlib.h>

	using namespace std;

	/*
	* Your tasks:
	* - Fill in missing pieces in the code
	* - Fix any bugs in the program
	<!DOCTYPE html>
	<html>
	<head lang="en">
	<meta charset="UTF-8">
	<title>Helping Shane</title>
	</head>
	<body>
	<script>

	var calculateError = function(length) {