ALGOL 60
1 program
Added 2026-02-05T12:00:00Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: Algol-60, ALGOL60
Provenance: commit 5148847a73 · authored 2026-02-05T23:50:25+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/algol-60-2Wikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | procedural · imperative · structured |
|---|---|
| Typing | static, strong |
| Designed by | Backus · Bauer · Green · Katz · McCarthy · Naur · Perlis · Rutishauser · Samelson · van Wijngaarden · Vauquois · Wegstein · Woodger |
| First appeared | 1960 |
| Influenced by | ALGOL 58 |
Related 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.
Quicksort
Provenance: commit 5148847a73 · authored 2026-02-05T23:50:25+01:00 · agent claude-code · model sonnet · WebSearch disabled
begin
procedure quicksort(A, low, high);
value low, high;
integer low, high;
real array A;
begin
integer i, j;
real pivot, temp;
if low < high then
begin
pivot := A[low];
i := low;
j := high;
for j := j step -1 until i do
begin
while A[i] < pivot do i := i + 1;
while A[j] > pivot do j := j - 1;
if i < j then
begin
temp := A[i];
A[i] := A[j];
A[j] := temp;
end;
end;
temp := A[low];
A[low] := A[j];
A[j] := temp;
quicksort(A, low, j - 1);
quicksort(A, j + 1, high);
end;
end quicksort;
end