Karteikarten
Sorting Algorithms
Karten in diesem Stapel (2)
- 1Bubble SortComparing each pair of neighboring elements and swapping them if there are any out of order
- 2Quick SortA divide and conquer algorithm.
Picks an element from the list as the pivot and partitions the list into two pieces (elements smaller than pivot value and elements larger) Then repeated on both sides until sorted
Informationen
- Beschreibung
- Computer Science Karteikarten am Sorting Algorithms, erstellt von Matthew Grant am 11/05/2019.
- Erstellt von
- Matthew Grant
- Aufrufe
- 1
- Bewertung