Tiger
1 program
Added 2026-02-10T18:01:21Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 02e7caaccc · authored 2026-02-10T19:02:18+01:00 · agent claude-code · model sonnet
Sources mentioning this language
2 sources · pl_id:
pl/tigerRelated languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Merge Sort
Provenance: commit 02e7caaccc · authored 2026-02-10T19:02:18+01:00 · agent claude-code · model sonnet · WebSearch disabled
/* Merge sort in Tiger */
let
type intArray = array of int
function merge(arr: intArray, left: int, mid: int, right: int) =
let
var n1 := mid - left + 1
var n2 := right - mid
var L := intArray [n1] of 0
var R := intArray [n2] of 0
var i := 0
var j := 0
var k := left
in
for i := 0 to n1-1 do
L[i] := arr[left + i];
for j := 0 to n2-1 do
R[j] := arr[mid + 1 + j];
i := 0;
j := 0;
while i < n1 & j < n2 do (
if L[i] <= R[j] then (
arr[k] := L[i];
i := i + 1
) else (
arr[k] := R[j];
j := j + 1
);
k := k + 1
);
while i < n1 do (
arr[k] := L[i];
i := i + 1;
k := k + 1
);
while j < n2 do (
arr[k] := R[j];
j := j + 1;
k := k + 1
)
end
function mergeSort(arr: intArray, left: int, right: int) =
if left < right then
let
var mid := left + (right - left) / 2
in
mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);
merge(arr, left, mid, right)
end
var arr := intArray [6] of 0
in
arr[0] := 12;
arr[1] := 11;
arr[2] := 13;
arr[3] := 5;
arr[4] := 6;
arr[5] := 7;
mergeSort(arr, 0, 5)
end