Скачать с ютуб Visualizing 70 Sorting Algorithms в хорошем качестве

Visualizing 70 Sorting Algorithms

Full explanation video:    • Every Sorting Algorithm Explained in ...   This video shows off my sorting algorithm visualization program that I made with c++ and sfml. I programmed the algorithms myself in order to properly understand them for the explanation video. For smooth, poplar, wiki, and grail, I didn't have time to program them, so I used ArrayV. The sound effects in this video are mostly musescore samples or audacity generated tones, chirps, etc. Chapters: 0:00 Selection 0:25 Double Selection 0:37 Insertion 1:00 Binary Insertion 1:14 Bubble 1:38 Shaker 2:01 Comb 2:21 Heap 2:43 Min Heap 2:55 Shell 3:24 Quick 3:47 Merge 4:15 Radix LSD (b = 4) 4:35 Radix LSD (b = 10) 4:52 Radix MSD (b = 4) 5:15 Radix MSD (b = 10) 5:33 Bucket (b = 10) 6:04 Bucket (b = n/10) 6:18 Counting 6:32 Gravity 6:45 Bogo 7:08 Pancake 7:37 Cycle 8:04 Exchange v1 8:28 Exchange v2 8:44 Odd Even 9:08 Gnome 9:32 Baiai 9:55 Circle 10:12 Patience (cheat version) 10:42 Strand (cheat version) 11:19 Bitonic 11:58 Recursive Bitonic 12:14 Alternate Bitonic 12:30 Bitonic w/ Parallel Processors 12:41 Odd Even Network 13:16 Pairwise Network 13:50 Quick LL 14:26 Dual Pivot Quick 14:59 Proportion Extend 15:28 Intro 16:00 Pattern Defeating Quick 16:29 Tim 17:07 Iterative Merge v1 17:31 Iterative Merge v2 17:56 In Place Merge (basic edition) 18:21 Weave 18:53 Rotate Merge 19:29 Quad 20:00 Weak Heap 20:38 Ternary Heap 21:21 Smooth 21:46 Poplar 22:01 In Place Radix MSD (b = 4) 22:30 Binary Quick (b = 2) 22:58 In Place Radix LSD (b = 4) 23:24 American Flag (b = 128) 23:40 Spread (b = n/10) 23:57 Sample (b = n/10, s = 2) 24:23 Proxmap (b = n/10) 24:43 Sqrt (Kuvi version) 25:20 Original Block 26:03 Wiki 26:33 Grail 27:11 Stooge 27:38 Slow 28:05 Stalin 28:15 Miracle 28:34 Identity Crisis 29:01 Quantum Bogo #sorting #algorithms #computerscience #visualization #satisfying