# \#algorithm

**URL:** https://scanalyst.fourmilab.ch/tag/algorithm/10.md

[Latest](https://scanalyst.fourmilab.ch/latest.md) · [Categories](https://scanalyst.fourmilab.ch/categories.md) · [Tags](https://scanalyst.fourmilab.ch/tags.md)

---

## [The A\* Graph Search Algorithm](https://scanalyst.fourmilab.ch/t/the-a-graph-search-algorithm/2728)

<div class="topic-metadata">

**Author:** [@johnwalker](https://scanalyst.fourmilab.ch/u/johnwalker)\
**Replies:** 1\
**Last updated:** [10 February 2023 20:50 UTC](https://scanalyst.fourmilab.ch/t/the-a-graph-search-algorithm/2728 "2023-02-10T20:50:37Z")

</div>

A frequently-encountered problem in programming is finding the shortest path between two nodes in a weighted graph. For example, consider a graph where nodes represent cities and edges are highways connect…

---

## [Donald Knuth's 2022 Christmas Tree Lecture: “Twintrees, Baxter Permutations, and Floorplans”](https://scanalyst.fourmilab.ch/t/donald-knuths-2022-christmas-tree-lecture-twintrees-baxter-permutations-and-floorplans/2569)

<div class="topic-metadata">

**Author:** [@johnwalker](https://scanalyst.fourmilab.ch/u/johnwalker)\
**Replies:** 0\
**Last updated:** [6 January 2023 16:37 UTC](https://scanalyst.fourmilab.ch/t/donald-knuths-2022-christmas-tree-lecture-twintrees-baxter-permutations-and-floorplans/2569 "2023-01-06T16:37:39Z")

</div>

For twenty-six years, Donald Knuth has given a public lecture in December which he called the “Christmas Tree Lecture”, as he would each time discuss a new result relating to tree data structures and the ma…

---

## [The “I Can't Believe It Can Sort” Algorithm](https://scanalyst.fourmilab.ch/t/the-i-cant-believe-it-can-sort-algorithm/60)

<div class="topic-metadata">

**Author:** [@johnwalker](https://scanalyst.fourmilab.ch/u/johnwalker)\
**Replies:** 4\
**Last updated:** [5 November 2021 18:25 UTC](https://scanalyst.fourmilab.ch/t/the-i-cant-believe-it-can-sort-algorithm/60 "2021-11-05T18:25:58Z")

</div>

The abstract: “We present an extremely simple sorting algorithm. It may look like it is obviously wrong, but we prove that it is in fact correct. We compare it with other simple sorting algorithms, and analyse some of …

---

## [The Sound of Sorting: Fifteen Algorithms in Six Minutes](https://scanalyst.fourmilab.ch/t/the-sound-of-sorting-fifteen-algorithms-in-six-minutes/128)

<div class="topic-metadata">

**Author:** [@johnwalker](https://scanalyst.fourmilab.ch/u/johnwalker)\
**Replies:** 0\
**Last updated:** [16 October 2021 13:44 UTC](https://scanalyst.fourmilab.ch/t/the-sound-of-sorting-fifteen-algorithms-in-six-minutes/128 "2021-10-16T13:44:54Z")

</div>

Sorting items into order is an important task in computing, and a great deal of intellectual effort has been put into studying various techniques optimised for different circumstances. For example, sorting…