AliE99

assembly8086

my Assembly Projects Fall 98

BookApiProject

booking

huffman-tree-ui

huffman_tree

min-cut

The goal of the algorithm is to find a global min-cut in a graph in polynomial time. The graph is undirected and allows parallel edges. The algorithm chooses an edge randomly and contracts it. The procedure is performed recursively until two nodes remain.

speech-assistant

Speech assistant app using the speech recognition library and Google's text-to-speech API.

tahw1-array-reverse-starter

TLA-Project-Syntax-Error-Finder-For-Java

this a simple project that finds some java's syntax errors

triangulation

A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices (corners) such that the diagonals never intersect. The problem is to find the cost of triangulation with the minimum cost.

url-shortener