Finding the length of the shortest closed polyline (in Cartesian coordinate system) of the given vertices and of the number of edges equal to the number of vertices, by exhaustive search.
Finding all permutations of a given multiset, with a given order on it, in lexicographic order.
Binary heap, heapsort
–ary heap (aka
Counting inversions in a permutation of first
natural numbers — in
Place k elements such that minimum distance is maximized — binary search approach. Explained and implemented declaratively with Common Lisp.
bełkotliwa prezka o drzewach AVL i B-drzewach