Cocktail Sort 2—New and Improved
Loading...
Loading...
14:59
shell32.dllby TheKeaper9,995 views- 1:30
What different sorting algorithms sound likeby andrut395,689 views
- 1:24
Barack Obama - Computer Science Questionby weedipikia680,505 views
- 0:48
Bubble Sort Algorithmby kinkydarkbird12,339 views
- 1:54
Insertion Sortby AcabeeOrg2,559 views
- 2:02
Algorithms #3 - Selection Sortby codegearguru44,608 views
- 16 videosSorting Algorithms
- 0:30
Radix Sort Visualized and with Audioby sgtunix7,173 views
- 1:06
Selection Sortby nmulder27299,745 views
- 3:04
shaker sortby rokrgdl1,711 views
- 0:04
Fisher-Yates Shuffleby kinkydarkbird785 views
- 0:40
InsertionSort on Aliceby HirokiJPN1,200 views
- 0:24
Pancake sort algorithm, visualization with VTKby mariostorti6,233 views
- 1:20
Insertion Sortby TheSDDHSC1,813 views
- 4:31
Insert Sortby Porfi88109,927 views
- 5:50
Insertion Sortby risersheriff10,956 views
- 6:10
Heap Sortby 1071117944,169 views
- 5:26
The Radix Sort Explained By Skyler L.A.by skylerlisteraley11,325 views
- 3:26
Comb Sortby Shishberg2,328 views
- 6:29
Heapsortby ingenieriauchile7,803 views
@SilkSwe So it just picks an element, check it against all unsorted elements and then swaps things around? makes sense :)
Pureferret 8 months ago
@Pureferret That's no problem. This is just bubblesort going both ways. It starts by taking the first non-sorted element and as it progresses it checks to see if it can find a element that's bigger than the reference. If it does it switches to use the new largest element as reference. Once it reaches the end it has found the next element and therefore marks it as sorted. Going back is the same thing except it tries to find the smallest non-sorted element.
SilkSwe 8 months ago
Hows does it work when the elements aren't evenly spaced, i.e. with gaps?
Pureferret 10 months ago