Room II
The First Languages
- apply 1960
apply[fn;x;a] = [atom[fn] → [eq[fn;CAR] → caar[x]; eq[fn;CDR] → cdar[x]; eq[fn;CONS] → cons[car[x];cadr[x]]; eq[fn;ATOM] → atom[car[x]]; eq[fn;EQ] → eq[car[x];cadr[x]]; - Algorithm 64: Quicksort 1961
procedure quicksort (A,M,N); value M,N; array A; integer M,N; begin integer I,J; if M < N then begin partition(A,M,N,I,J); quicksort(A,M,J); quicksort(A,I,N); - Line 1965
void line(int x0, int y0, int x1, int y1) /* first octant: 0 <= dy <= dx */ { int dx = x1 - x0, dy = y1 - y0; int e = 2 * dy - dx; int x, y = y0; - hello, world 1978
#include <stdio.h> main() { printf("hello, world\n"); }