Analysis of Algorithms: An Example of a Sort Algorithm

DOI10.2478/forma-2013-0001zbMath1296.68204OpenAlexW2034215276MaRDI QIDQ2852177

Grzegorz Bancerek

Publication date: 8 October 2013

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/forma-2013-0001

zbMATH Keywords

algorithmssorting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (8)

\(N\)-dimensional binary vector spaces ⋮ More on divisibility criteria for selected primes ⋮ Differentiation in normed spaces ⋮ Polygonal numbers ⋮ Constructing binary Huffman tree ⋮ Riemann integral of functions from \(\mathbb{R}\) into real Banach space ⋮ On square-free numbers ⋮ Pythagorean tuning: pentatonic and heptatonic scale

Uses Software

• Mizar

Cites Work

• Free Term Algebras
• Program Algebra over an Algebra
• Sorting by Exchanging

This page was built for publication: Analysis of Algorithms: An Example of a Sort Algorithm