REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3602
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorBancerek, Grzegorz-
dc.date.accessioned2015-12-06T19:04:36Z-
dc.date.available2015-12-06T19:04:36Z-
dc.date.issued2011-
dc.identifier.citationFormalized Mathematics, Volume 19, Issue 2, 2011, Pages 93-102-
dc.identifier.issn1426-2630-
dc.identifier.issn1898-9934-
dc.identifier.urihttp://hdl.handle.net/11320/3602-
dc.description.abstractWe show that exchanging of pairs in an array which are in incorrect order leads to sorted array. It justifies correctness of Bubble Sort, Insertion Sort, and Quicksort.-
dc.language.isoen-
dc.publisherDe Gruyter Open-
dc.titleSorting by Exchanging-
dc.typeArticle-
dc.identifier.doi10.2478/v10037-011-0015-4-
dc.description.AffiliationBiałystok Technical University, Poland-
dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.-
dc.description.referencesGrzegorz Bancerek. Ordinal arithmetics. Formalized Mathematics, 1(3):515-519, 1990.-
dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
dc.description.referencesGrzegorz Bancerek. Sequences of ordinal numbers. Formalized Mathematics, 1(2):281-290, 1990.-
dc.description.referencesGrzegorz Bancerek. Directed sets, nets, ideals, filters, and maps. Formalized Mathematics, 6(1):93-107, 1997.-
dc.description.referencesGrzegorz Bancerek. Mizar analysis of algorithms: Preliminaries. Formalized Mathematics, 15(3):87-110, 2007, doi:10.2478/v10037-007-0011-x.-
dc.description.referencesGrzegorz Bancerek. Veblen hierarchy. Formalized Mathematics, 19(2):83-92, 2011, doi: 10.2478/v10037-011-0014-5.-
dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.-
dc.description.referencesGrzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485-492, 1996.-
dc.description.referencesCzesław Byliński. Basic functions and operations on functions. Formalized Mathematics, 1(1):245-254, 1990.-
dc.description.referencesCzesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.-
dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.-
dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.-
dc.description.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.-
dc.description.referencesCzesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.-
dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
dc.description.referencesAndrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4):341-347, 2003.-
dc.description.referencesWojciech A. Trybulec and Grzegorz Bancerek. Kuratowski - Zorn lemma. Formalized Mathematics, 1(2):387-393, 1990.-
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
dc.description.referencesTetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.-
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.-
dc.description.referencesEdmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.-
Występuje w kolekcji(ach):Formalized Mathematics, 2011, Volume 19, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
v10037-011-0015-4.pdf273,17 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons