ISBN: 9786130768089 - bubble sort: sorting algorithm, swap (computer science), comparison sort, odd- even sort, insertion sort, quicksort, inversion (computer science), ... sort, quicksort, pseudocode, computer science (3 Ergebnisse)

- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 136,00
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 100 pp. Englisch.

- Softcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 143,03
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.Bubble sort is asimple sorting algorithm. It works by repeatedly stepping through thelist to be sorted, comparing each pair of adjacent items and swappingthem if they are in the wrong order. The pass through the list isrepeated until no swaps are needed, which indicates that the list issorted. The algorithm gets its name from the way smaller elements'bubble' to the top of the list. Because it only uses comparisons tooperate on elements, it is a comparison sort.…

- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 136,00
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.Bubble sort is asimple sorting algorithm. It works by repeatedly stepping through thelist to be sorted, comparing each pair of adjacent items and swappingthem if they are in the wrong order. The pass through the list isrepeated until no swaps are needed, which indicates that the list issorted. The algorithm gets its name from the way smaller elements'bubble' to the top of the list. Because it only uses comparisons tooperate on elements, it is a comparison sort.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 100 pp. Englisch.…