Sat Jul 12 01:32:29 AM +08 2025 #79 ✎

https://github.com/aldanor/aoc-2021 https://en.wikipedia.org/wiki/Hacker's_Delight https://github.com/astral-sh/uv/pull/13469

Fri Jul 11 11:58:37 PM +08 2025 #78 ✎

Fri Jul 11 02:19:00 PM +08 2025 #77 ✎

Keypro II, 1982

Fri Jul 11 02:17:42 PM +08 2025 #76 ✎

Epson HX-20

Mon Jul 07 02:27:17 PM +08 2025 #75 ✎

yeah

Sun Jul 06 10:26:59 AM +08 2025 #74 ✎

Schneider CPC 464

Sun Jul 06 12:21:03 AM +08 2025 #73 ✎

Sat Jul 05 10:15:26 PM +08 2025 #72 ✎

hehe

Thu Jul 03 12:18:11 PM +08 2025 #71 ✎

IBM Selectric I

Thu Jul 03 02:11:14 AM +08 2025 #70 ✎

Arts_et_Metiers_Pascaline_dsc03869.jpg

Thu Jul 03 02:10:31 AM +08 2025 #69 ✎

Wed Jul 02 06:21:52 PM +08 2025 #68 ✎

DEC Digital VT100

Mon Jun 30 11:36:05 PM +08 2025 #67 ✎

Mon Jun 30 05:07:42 PM +08 2025 #66 ✎

Connection Machine (1985)

Fri Jun 27 06:35:35 PM +08 2025 #65 ✎

The idea of balancing a search tree is due to Adel’son-Vel’skiĭ and Landis, who introduced a class of balanced search trees called AVL trees in 1962. Another class of search trees, called 2-3 trees, was introduced by J. E. Hopcroft in 1970. A 2-3 tree maintains balance by manipulating the degrees of nodes in the tree. Bayer and McCreight later generalized 2-3 trees to form B-trees. Red-black trees were invented by Bayer under the name symmetric binary B-trees. Guibas and Sedgewick studied their properties in detail and introduced the red/black color convention. Andersson proposed a simpler-to-code variant of red-black trees, which Weiss later called AA-trees. An AA-tree is similar to a red-black tree except that left children may never be red. Treaps were proposed by Seidel and Aragon. They became the default implementation of a dictionary in LEDA, a well-known collection of data structures and algorithms. Other variations on balanced binary trees include weight-balanced trees, k-neighbor trees, and scapegoat trees. One of the most intriguing is the splay tree introduced by Sleator and Tarjan, which is self-adjusting. Splay trees maintain balance without any explicit balance conditions. Instead, splay operations involving rotations are performed within the tree every time an access is made. The amortized cost of each operation on an n-node tree is logarithmic. Skip lists provide an alternative to balanced binary trees. A skip list is a linked list augmented with additional pointers, allowing dictionary operations to run in expected logarithmic time.

Tue Jun 24 10:34:15 PM +08 2025 #64 ✎

reasonable

Tue Jun 24 10:26:24 PM +08 2025 #63 ✎

Lana_Del_Rey_Cannes_2012.jpg Elizabeth Woolridge Grant

Mon Jun 23 11:34:37 PM +08 2025 #62 ✎

macro_rules! box_it {
    ($value:literal) => {
        Box::new($value)
    };
}

fn main() {
    let stuff = box_it!("hello, world");
    println!("{stuff:?}");
}

Fri Jun 20 06:06:15 PM +08 2025 #61 ✎

fn main() {
    println!("hello, world");
}

Tue Jun 17 10:55:03 PM +08 2025 #60 ✎

Sat Jun 14 04:10:34 PM +08 2025 #59 ✎

N.Wirth. Algorithms and Data Structures. Oberon version Harold Abelson, Gerald Jay Sussman, Julie Sussman. Structure and Interpretation of Computer Programs

Fri Jun 13 12:45:16 PM +08 2025 #58 ✎

ken-and-den.jpeg

Thu Jun 12 09:10:05 PM +08 2025 #57 ✎

«Мы постоянно меняемся и очень важно помнить о том, что ты был положительным персонажем» Бараш

Thu Jun 12 08:44:35 PM +08 2025 #56 ✎

Thu Jun 12 03:14:50 AM +08 2025 #55 ✎

First, we want to establish the idea that a computer language is not just a way of getting a computer to perform operations but rather that it is a novel formal medium for expressing ideas about methodology. Thus, programs must be written for people to read, and only incidentally for machines to execute. Second, we believe that the essential material to be addressed by a subject at this level is not the syntax of particular programming-language constructs, nor clever algorithms for computing particular functions efficiently, nor even the mathematical analysis of algorithms and the foundations of computing, but rather the techniques used to control the intellectual complexity of large software systems.