49:56 this feels so much like a meme template and i love it
@roadto2000subsКүн бұрын
28:13 Rip n
@WideJupiter_officalКүн бұрын
All of the multiples of 17 are beautiful
@ckqКүн бұрын
2:45 is a good explanation, i dont think it needs more explanation
@ckqКүн бұрын
This explains why I've always liked 2, 5, and 7. I "hate" 3, and 11 is bigger than 10, so i have a more neutral opinion about it. I used to explain it as. 1² + 1 = 2 2² + 1 = 5 2 + 5 = 7 3² + 1 = 10 = 2 × 5 (i like base 10 more than bases divisible by 3) 7² + 1 = 50 = 2 × 5 × 5 = 5² + 5²
@ckqКүн бұрын
70 - divisible by 7 836 - its a weird multiple of 4 4030 - between 4000 and 4096 and divisible by 10 5830 - once again ends in 30, near 5776 = 76² 7192 - 1000 off of 8192 For me 544 looks like a number that's probably only divisible by 4, but it's actually divisible by 32. Personally im the #1 hater of primes of the form 4k+3 (and numbers divisible by them) since they can't be written as the sum of squares.
@ckqКүн бұрын
Hey I discovered a new coincidence that relates e to pi: The solution to x^x*(1-x)^(1-x) = 0.5^0.5 (See A102268 on the OEIS) x=0.889972 is almost nearly pi^2/16/ln(2) = 0.889927 the number pi^2/16/ln(2) didn't come out of nowhere either, it represents the ratio between (arcsin(sqrt(1))-arcsin(sqrt(0.5)))^2 and ln(1)-ln(0.5). For context on the y(x) = arcsin(sqrt(x)) function, it is the integral of 1/sqrt(x(1-x)), so it maps the numbers from 0 to 1 on a scale that is proportional to the standard deviation to account for the fact that there's a bigger difference between 0.99 and 1.00 than 0.50 and 0.51
@blahajgaemingКүн бұрын
Stalin sort shouldve been the algorithm disappearing 1 by 1
@pridepotato314Күн бұрын
15:53 Yes it has Pan, but it also has *Germany*
@justman017Күн бұрын
Stalin?
@MeYou-Sick2 күн бұрын
Could you let me know, how you made them? I mean the simulations. I would like to recreate them
@nojokeimcrying2 күн бұрын
Me *not understanding wtf is going on* Kewl sounds and colours hehe
@astropeter8362 күн бұрын
Shell Sort and Selection Sort is two of my favorite algorithms!But Shell Sort is my most favorite algorithm.I used Selection Sort in my school.
@chillero3heftig7122 күн бұрын
We can't speed up light waves ourself so that's why XD maybe eventually there will be found a way to change speed of light.
@chillero3heftig7122 күн бұрын
Oh shit here we go again
@TheRush.0002 күн бұрын
16:33 this tim sort is same as merge
@TheRush.0002 күн бұрын
18:23 this Weave sort is same as merge too
@franklinbates9252 күн бұрын
quick is my favorate.
@mitchellbailey55223 күн бұрын
Honestly quite incredible
@LitoMike3 күн бұрын
my ears are secreting some weird red substance right now
@theautisticdoomgod3 күн бұрын
THESE SOUNDS!!!!!!! 🤤🤤🤤🤤🤣🤣🤣🤣
@diegojost33513 күн бұрын
whadamawachin
@varniqueindia3 күн бұрын
i am happy to say that at the start of the vid i guessed the weirdest 3-digit number as 834
@aykarain3 күн бұрын
new samples!!??!?!?!?!?!?
@aykarain3 күн бұрын
imagine shadow product... but dont use divide, just use subtract cos i dont want decimals
@truongquangduylop333 күн бұрын
def comb_sort(data): """Sorts a list of data in ascending order using comb sort. Args: data: A list of sortable elements. Returns: A new list containing the sorted elements. """ shrink_factor = 1.3 gap = len(data) completed = False while not completed: # Update the gap value for a next comb gap gap = int(gap / shrink_factor) if gap < 1: gap = 1 completed = True index = 0 while index + gap < len(data): if data[index] > data[index + gap]: data[index], data[index + gap] = data[index + gap], data[index] index += 1 return data # Example usage my_data = [5, 2, 4, 6, 1, 3] sorted_data = comb_sort(my_data.copy()) # Avoid modifying original list print(sorted_data) # Output: [1, 2, 3, 4, 5, 6]
@truongquangduylop333 күн бұрын
def selection_sort(data): """Sorts a list of data in ascending order using selection sort. Args: data: A list of sortable elements. Returns: A new list containing the sorted elements. """ length = len(data) for i in range(length - 1): min_index = i for j in range(i + 1, length): if data[j] < data[min_index]: min_index = j if i != min_index: data[i], data[min_index] = data[min_index], data[i] return data # Example usage my_data = [64, 25, 12, 22, 11] sorted_data = selection_sort(my_data.copy()) # Avoid modifying original list print(sorted_data) # Output: [11, 12, 22, 25, 64]
@lilcoffee65284 күн бұрын
Truncated Icosahedron = football (no, not the 🦅🇺🇸⛓️💥AMERICAN🇺🇸⛓️💥🦅 version)
@appel-seed_4 күн бұрын
The sound before pancake sort- it's too cool
@flameofthephoenix83954 күн бұрын
(a+(n-b)+c)mod(n)
@Mordecrox5 күн бұрын
6:45 wake up babe new BogoSort type beat just dropped
@Vadow7895 күн бұрын
What a thorough explanation, bravo!
@airam17215 күн бұрын
But can it tspin?
@Warmlemonjuice5 күн бұрын
Not a bad thing but you have a math accent
@GamemodePC5 күн бұрын
i will never learn how the heck radix sort works
@thienluuduc22075 күн бұрын
wavw
@pickaxe42485 күн бұрын
how to estimate e by rounding off to 9 decimal places: 271801/99990
@galinakazakova37376 күн бұрын
Love what you do! Kuvina, you're genius, I am officially your fan!❤ apart from the comprehensiveness of the presentation, I am just blown away by the graphics and the sound, the overall aesthetic and idea, simply amazing!🤯 Chapeau!
@mansurehrezaeitabar31106 күн бұрын
0:06 Selection Sort,1st Sort of Selection Sorts Family 0:26 Double Selection Sort,2nd Sort of Selection Sorts Family 0:37 Insertion Sort,1st Sort of Insertion Sorts Family 1:00 Binary Insertion Sort,2nd Sort of Insertion Sorts Family 1:14 Bubble Sort,1st Sort of Exchange Sorts Family 1:39 Cocktail Shaker Sort,2nd Sort of Exchange Sorts Family 2:01 Comb 🪮 Sort,3rd Sort of Exchange Sorts Family 2:21 Maximum Heap Sort,3rd Sort of Selection Sorts Family 2:43 Minimum Heap Sort,4th Sort of Selection Sorts Family 2:55 Shell 🐚 Sort,3rd Sort of Insertion Sorts Family 3:24 Quick Sort(Left/Right Pointers),4th Sort of Exchange Sorts Family 3:47 Merge Sort,1st Sort of Merge Sorts Family 4:15 Least Significant Digit Radix Sort(Base 4),1st Sort of Distribution Sorts Family 4:35 Least Significant Digit Radix Sort(Base 10),2nd Sort of Distribution Sorts Family 4:53 Most Significant Digit Radix Sort(Base 4),3rd Sort of Distribution Sorts Family 5:16 Most Significant Digit Radix Sort(Base 10),4th Sort of Distribution Sorts Family 5:33 Bucket 🪣 Sort(10 Buckets),5th Sort of Distribution Sorts Family 6:04 Bucket 🪣 Sort(10 Bucket Numbers),6th Sort of Distribution Sorts Family 6:19 Counting Sort,7th Sort of Distribution Sorts Family 6:33 Fake Gravity Sort,8th Sort of Distribution Sorts Family 6:46 BOGO Sort,1st Sort of Impractical Sorts Family 7:08 Pancake 🥞 Sort,a Misccelaneous Sort 7:37 Cycle 🔁🔄🔃 Sort,5th Sort of Selection Sorts Family 8:05 Sandpaper Sort(aka Earthbound Sort),5th Sort of Exchange Sorts Family 8:28 Reverse Sandpaper Sort(or Reverse Earthbound Sort),6th Sort of Exchange Sorts Family 8:44 Odd-Even Sort,7th Sort of Exchange Sorts Family 9:08 Gnome Sort,8th Sort of Exchange Sorts Family 9:32 Baiai Sort,Unknown Sort Family 9:55 Circle ⭕️ Sort,9th Sort of Exchange Sorts Family
@not_estains6 күн бұрын
now explain every shuffling algorithm
@truongquangduylop337 күн бұрын
R
@goodguyamr69967 күн бұрын
I’m tempted to make up a base-70 numeral system and make people suffer using it
@kennetteurbano70427 күн бұрын
23.1406926327770923…
@mrkitten9997 күн бұрын
8:11 Here, I immediately wondered what the primitive abundant numbers with the highest abundance are (or if it increases) and if there are an infinite number of them (also: glider in top left at 14:06)
@micahrobbins83537 күн бұрын
I've been slowly teaching myself this stuff for fun, and goodness gracious, this is like the ENTIRE rabbit hole condensed into a single video. I personally got stuck on black body stuff lol
@thermitty_qxr52768 күн бұрын
Hey great video you put effort into, but I got some small problems about your intro jingle It doesn't sound pleasant since there is too much tension which isn't resolved nicely meaning it sounds like it's not done and unsatisfaction. (I assume the first note is the home note or the note that sounds at rest). I may be wrong, and that is supposed to be like that because of the message you're supposed to show. But if not, I can help make a better one because I understand some music theory and I'm a newbie. Thanks for reading
@Ehanray8 күн бұрын
Algorithm 3 is super efficient its already done in 13 seconds
@nnhm8 күн бұрын
This is the one that made it click for me for color spaces. I'm a developer and learning color grading for videography too, and this is of immense help 🙏
@helloiamenergyman8 күн бұрын
OMG THEY MENTIONED THE WATERMAN BUTTERFLY XHN GYJHBNFHNBVGJCFYBVTUJCUT
@helloiamenergyman8 күн бұрын
HOW DARE YOU GIVE IT A 2 IN AESTHETICS ITS THE BEST FVUCKINGF PROJECTION EVER IN TH|AT CATEGROY
@lourdesmercedes12018 күн бұрын
77777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777 is very very very very very very very lucky!! The more 7's the more lucky!!