www.cs.utexas.edu

CS 315: Study Guide for Final Exam

Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.
archive

[Coursera] Algorithms Part I

remove-circle Internet Archive's in-browser video "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your ...
C&EN

Modeling Molecularly Imprinted Nanoparticles with LNKD: A Resource Efficient Algorithm for Polymer Cross-Linking

Department of Chemistry and Chemical Biology, Northeastern University, Boston, Massachusetts 02115, United States Department of Chemistry and Chemical Biology, Northeastern University, Boston, ...
GitHub

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript.

Now with support for async comparators with the new HeapAsync class! Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods. Easy to use, known interfaces, tested ...
GitHub

driftsort: an efficient, generic and robust stable sort implementation.

This document explains and verifies the design goals for an efficient, generic and robust stable sort implementation called driftsort by Orson Peters and Lukas Bergdoll (source code). TL;DR: driftsort ...