Select Sort

In computer science, a selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.

For more information about Select Sort check the Wikipedia article here

ZME Science posts about Select Sort

Sorting algorithms illustrated through folk dances

Thu, Apr 14, 2011

0 Comments

Various simulations of algorithms can be seen everywhere, especially in nature, but a recent project from the Sapientia University, Romania is definitely one of the most imaginative and novel initiatives of illustrating algorithms. The folks at Sapientia University demonstrate how different sorting algorithms work with numbered people dancing traditional Central European folk songs and arranging [...]

Algorithms, Bubble Sort, Folk dance, Insert Sort, Select Sort, Shell Sort

You are here: ZME Science » Select Sort

Subscribe for FREE!

Popular This Week

Drop us a line!

Tip us on news, scientific reports and studies, scientific advances, science art, interesting phenomena or any kind of science related material. Just write to andrei@zmescience.com.