C++ & Java implementations of 6 algorithm problems — tromino tiling, knight's tour, Tower of Hanoi (4-peg), knight swap, target shooting, and lattice coverage — using Divide & Conquer, Greedy, BFS, ...

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.

Big O describes how an algorithm’s cost grows with input size. It is an upper bound that abstracts hardware and constants so you can compare designs, reason about scalability, and anticipate ...

Sorting is one of the fundamental operations in computer science. Among the various sorting techniques, Insertion Sort is a simple yet efficient method for small datasets or nearly sorted data.

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 ...

Library of sorting algorithms in various languages. Contains implementations for Insertion sort, Selection sort, Comparison Count sort, Quicksort, Mergesort and Bubblesort.