All the coding exercises I live-coded with students during the recitation hours.
-
Updated
Dec 2, 2014 - Python
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
All the coding exercises I live-coded with students during the recitation hours.
An implementation of using the x-fast trie for fast predecessor search. Illustrated with an example of the problem of searching for the closest movie release meeting some arbitrary condition.
A N-Children tree developed in Python, nothing fancy !
A collection of python scripts to implement various sort/search algorithms and supporting data structures.
Implementation of the basics of algorithms and data structures including searching, sorting, lists, stacks, queues, hash tables, trees, and graphs.
Solutions to Algorithms and Data Structures course for LITS
A motley collection of snippets, language idioms, algorithms, puzzles, and exploratory code.
Python programs.
This is for EECS214 data structures course with github.com/tov/eecs214. This script will be a command line tool that can encode a given file into huffman char, and is accompanied by a decoding file that can reconstruct the huffman tree and the original file.
Simple Python 3 implementations of popular algorithms and data structures.
Bloom Filter in Python using Murmurhash3
Utilizes a Huffman tree to compress text files
Python application used to match listings against openings via authenticated JSON API access.
Building data structures of trees and graphs for the first time and understanding concepts
First Dynamic Programming project for DS
A FIFO cache implementation in Python with lock-free reads.
A simplistic bloomfilter implementation in pure python.