Hi there, some call me Summer while others call me John; I'm a certified teacher, musician, hobbyist programmer, gamer, and fellow human being. Hope you enjoy my videos!
Check out the NEW home for ArrayV here: github.com/gaming32/ArrayV-v4.0 Visit the channel Discord here: discord.gg/thestudio BACKUP DISCORD LINK: discord.gg/2xGkKC2 Check out the Mother 1+2 Restoration project: discord.com/invite/ajQf9Ut
Support me on Ko-Fi: ko-fi.com/summerdragonfly
Profile picture and channel banner art drawn by aphitorite (ru-vid.com/show-UCMxlP-fVbnVuf3JbpwGVxng).
Wow. You're back. Unreal. Just curious, I was using ArrayV 5,1 the other day, and am curious, When are we gonna be able to see auxiliary arrays in the videos?
i think the "bit reversal" is the "perfect shuffle" because most thingslike bubble sort curves and distribution among merge sort sublists is near-perfect.
Quick sort partitions are also perfectly split by the center, circle sort passes also split by the center, for each sublist, Heaps also sizes that are powers of two, etc.
The enxt step for grailsort killer input is to distribute the elements in a way that leaves the least amount of connected consecutive elements for the final lazy stable sort pass that combines the buffer and the array.
29:50 Introspective sort: quick sort, how you doing? quick sort: *only sorted like 15 elements Introspective sort: oh your doing awful *shoves otu quicksort and puts down heap sort* do it or you get replaced too heap sort:* sorts array* introspective sort: good job quick sort: 8sobs* introspective sort: not my fault u suck
8:50 Selection sort: Cycle, how do you sort arrays? Cycle sort: magically fade it into existence Selection sort: What? Cycle sort: *array magically fades into sorted existence* Selection: HOW-
21:16 Merge sort: "Oh great, now we're taking random sorts and making them recursive and calling them 'merge sorts'? That's disrespectful." Lazy Stable Sort: "Then how come you never say I'm disrespectful?" Merge sort: "...Shut up."
