Smoothsort

Heaps (data structures) | Comparison sorts | Sorting algorithms

In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of O(n log n), but it is not a stable sort. The advantage of smoothsort is that it comes closer to O(n) time if the input is already sorted to some degree, whereas heapsort averages O(n log n) regardless of the initial sorted state. (Wikipedia).

SmoothLife 3D cells

with smooth time stepping.

From playlist SmoothLife

SmoothLife6

This came as a surprise. Although it looks like an example with smooth time-stepping, it is not. It is with original, simple time-stepping. I'm not exactly sure what this means. Maybe my smooth time-stepping method is superfluous.

From playlist SmoothLife

Game of Life generalized - SmoothLifeP

with smooth time-stepping.

From playlist SmoothLife

Game of Life generalized - SmoothLifeL

with smooth time-stepping.

From playlist SmoothLife

Game of Life generalized - SmoothLifeJ

with smooth time-stepping.

From playlist SmoothLife

SmoothLife multiscale 1

SmoothLife with three scales, i.e. outer radii differing by factors of 3, similar to McCabe's multiscale Turing patterns. The rules on all three scales are the same, although they could also be different. Download from sourceforge available http://sourceforge.net/projects/smoothlife/ .

From playlist SmoothLife