Dorothea Hörmann hdorothea

## fakeBackend.js
var FAILURE_COEFF = 10;
var MAX_SERVER_LATENCY = 200;

function getRandomBool(n) {
  var maxRandomCoeff = 1000;
  if (n > maxRandomCoeff) n = maxRandomCoeff;
  return Math.floor(Math.random() * maxRandomCoeff) % n === 0;
}

function getSuggestions(text) {

## binarySearch.ts
// input is an ordered array
let input_1 = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']

// we pick a random value from the input array
let randomValue = input_1[Math.floor(Math.random() * input_1.length)];

let binaryGuessIndex = (sortedArray:any[]): number => Math.floor(sortedArray.length/2)

function search (sortedArray:any[], value:any): any {

## hash_table.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                hdorothea
                / hash_table.ipynb
            
            
              Last active
              November 17, 2016 16:38
            
              
                A one afternoon "proof of I understood" implementation of a hash table in python
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## tictactoe.py
import itertools


class Board(object):

    def __init__(self):
        self.rows = [[' ', ' ', ' '], [' ', ' ', ' '], [' ', ' ', ' ']]

    @property
    def diagonals(self):

## example_plots.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                hdorothea
                / example_plots.ipynb
            
            
              Created
              July 31, 2016 11:35
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## cracklepop.s
.section .data

number:
.quad 0 # we start out with 0

crackle_output:
.ascii "Crackle\n"

pop_output:
.ascii "Pop\n"
	var FAILURE_COEFF = 10;
	var MAX_SERVER_LATENCY = 200;

	function getRandomBool(n) {
	var maxRandomCoeff = 1000;
	if (n > maxRandomCoeff) n = maxRandomCoeff;
	return Math.floor(Math.random() * maxRandomCoeff) % n === 0;
	}

	function getSuggestions(text) {
	// input is an ordered array
	let input_1 = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']

	// we pick a random value from the input array
	let randomValue = input_1[Math.floor(Math.random() * input_1.length)];

	let binaryGuessIndex = (sortedArray:any[]): number => Math.floor(sortedArray.length/2)

	function search (sortedArray:any[], value:any): any {
	import itertools


	class Board(object):

	def __init__(self):
	self.rows = [[' ', ' ', ' '], [' ', ' ', ' '], [' ', ' ', ' ']]

	@property
	def diagonals(self):
	.section .data

	number:
	.quad 0 # we start out with 0

	crackle_output:
	.ascii "Crackle\n"

	pop_output:
	.ascii "Pop\n"