Click 'See inside' and go to the 'My Blocks' section of the Block Menu, next: 1. Set the number of elements (n) using the slider (n = 2^), because (n) can only be a power of 2. 2. Always click Green Flag after changing (n = 2^) 3. Click on any pink block starting with a number to initialize and perform different shuffles. Example: [1_shuffle] or [2_reverse] 4. Click on any pink block starting with 'A' to perform a Sorting Algorithm on the shuffled list. Example: [A8_Bitonic Sort] or [A1.1_Comb Sort] 5. Once the sorting is finished, you may shuffle the array again and perform any sort again. Pink blocks starting with 'z' are meant to be ignored.
10 Different Sorting Algorithms Visualized Using a Pie Graph. Inspired by Musicombo and w0rthy on YouTube: https://www.youtube.com/@Musicombo https://www.youtube.com/@w0rthy_ Check out this video for some neat explanations: https://youtu.be/h1Bi0granxM Note: Only the 'Iterative' counterparts of most normally 'Recursive' Sorting Algorithms are used, due to Scratch's inability to handle recursion well. Simple Triangle Filler by @moonhayul: https://scratch.mit.edu/projects/577238002/ Most Sorts from geeksforgeeks.org Radix Sort: https://youtu.be/ujb2CIWE8zY Bitonic Sort: https://sortvisualizer.com/bitonicsort/ => Base Converter by @Zro716: https://scratch.mit.edu/projects/26187976/ => Bitwise XOR by @Firedrake969: https://scratch.mit.edu/projects/14213784/
