Sebastian Wild's Site

Simple proof that standard mergesort with a single extra comparison is run-adaptive in a rather strong sense.

GitHub blocked my account.

My colleague Tony McCabe put a game implementation of merging policies together, where you can try to find the minimal-mergecost order of merges.

I presented Powersort and its story at PyCon US 2023, the largest Python community conference.

If you consider contributing sorted lists from your own Python application to our benchmark for adaptive sorting, the steps below show you how to do collect this data.

For experimenting with novel CPython features, you can quickly set up an isolated environment.

Our sorting method Powersort (Wikipedia) is used as default list.sort() algorithm in CPython, the reference implementation of the Python programming language.

A rigorous proof that a stack implemented with doubling arrays has constant amortized time operations; written up here since it does not seem to appear in any of the standard algorithms books.

Showing more than 15 recent folders in move-to and copy-to context menus is easy in Thunderbird 91.

I describe my solution for online lecturing amid the COVID-19 crisis using youtube livestreams and PINGO.