Rosalind — Algorithmic Heights

The Algorithmic Heights track: sorting, heaps, graph search and shortest paths, written in BioLang rather than called from a builtin. See the problem list.

34 problems — 34 solved, 0 partial. 34 carry assertions that run on every commit; 0 need a network connection and are checked separately.

Problem statements © rosalind.info — paraphrased, not reproduced. Titles, published sample datasets and expected answers are reproduced only as far as verification needs them. Every problem links to its rosalind.info page.

The solutions themselves are not published here. Rosalind asks that solutions not be posted outside their site, and this page cites Rosalind as an independent check on BioLang, so it reports what was verified rather than showing the code. Every problem below links to its own page on rosalind.info.

Sections

Or read every problem on a single page — heavier to load, but one place to scroll, search and print.

Every problem

Problem Title Status Section Checked
FIBO Fibonacci Numbers solved Recursion verified by bl test
BINS Binary Search solved Searching verified by bl test
DEG Degree Array solved Graphs verified by bl test
INS Insertion Sort solved Sorting verified by bl test
DDEG Double-Degree Array solved Graphs verified by bl test
MAJ Majority Element solved Arrays verified by bl test
MER Merge Two Sorted Arrays solved Sorting verified by bl test
2SUM 2SUM solved Arrays verified by bl test
BFS Breadth-First Search solved Graphs verified by bl test
CC Connected Components solved Graphs verified by bl test
HEA Building a Heap solved Heaps verified by bl test
MS Merge Sort solved Sorting verified by bl test
PAR 2-Way Partition solved Sorting verified by bl test
3SUM 3SUM solved Arrays verified by bl test
BIP Testing Bipartiteness solved Graphs verified by bl test
DAG Testing Acyclicity solved Graphs verified by bl test
DIJ Dijkstra's Algorithm solved Graphs verified by bl test
HS Heap Sort solved Sorting verified by bl test
INV Counting Inversions solved Sorting verified by bl test
PAR3 3-Way Partition solved Sorting verified by bl test
SQ Square in a Graph solved Graphs verified by bl test
BF Bellman-Ford Algorithm solved Graphs verified by bl test
CTE Shortest Cycle Through a Given Edge solved Graphs verified by bl test
MED Median solved Searching verified by bl test
PS Partial Sort solved Sorting verified by bl test
TS Topological Sorting solved Graphs verified by bl test
HDAG Hamiltonian Path in DAG solved Graphs verified by bl test
NWC Negative Weight Cycle solved Graphs verified by bl test
QS Quick Sort solved Sorting verified by bl test
SCC Strongly Connected Components solved Graphs verified by bl test
2SAT 2-Satisfiability solved Graphs verified by bl test
GS General Sink solved Graphs verified by bl test
SC Semi-Connected Graph solved Graphs verified by bl test
SDAG Shortest Paths in DAG solved Graphs verified by bl test