say4n

#! /usr/bin/env python3

class Heap:
    """
    Min-heap implementation.
    """
    def __init__(self, ordering='min'):
        self.data = []
        assert str.lower(ordering) in ('min', 'max')
        self.ordering = ordering

say4n

#! /usr/bin/env python3

from typing import Any, Dict

class Node:
    def __init__(self, value=None):
        self.value: Any = value
        self.children: Dict[str, Node] = {}

class Trie:

say4n

#! /usr/bin/env python3

import random

class HashMap:
    def __init__(self, num_buckets=100):
        self.num_buckets = num_buckets
        self.buckets = [[] for _ in range(num_buckets)]
        
    def put(self, key, val):

say4n

say4n

.PHONY: all

all: heap

heap: heap.cpp
	$(CXX) -std=c++11 heap.cpp

say4n

Keybase proof

I hereby claim:

• I am say4n on github.
• I am sayan (https://keybase.io/sayan) on keybase.
• I have a public key ASAMjHcD5qnE2nmA3mCV6PgDpvLNkRSE1NHJpfHlapyf-wo

To claim this, I am signing this object:

say4n

.PHONY: all

all: procA procB

procA: processA.cpp
	mkdir -p build
	$(CXX) -std=c++11 processA.cpp -o build/procA.out

procB: processB.cpp
	mkdir -p build

say4n

#! /usr/bin/env python3

from copy import deepcopy


def median(l):
    l = sorted(l)

    if len(l) % 2 == 0:
        return (l[len(l)//2] + l[len(l)//2 - 1])/2

say4n

#! /usr/bin/env python3


class Relation:
    def __init__(self, *, attributes=None, name=None):
        self.attributes = attributes
        self.name = name

        self.rows = []

say4n

#! /usr/bin/env python3


class Node:
    """abstract base class for Nodes"""
    def __init__(self):
        pass

    def __repr__(self):
        raise NotImplementedError()