- Видео 15
- Просмотров 412 449
CuriousWalk
США
Добавлен 2 мар 2021
Welcome to your curious walk through the fields of science.
Waves | 3D Simulation | Manim in Colab
This 3D simulation features Manim scenes of wave interference.
This video is produced with the animation engine Manim.
Manim - Mathematical Animation Framework. www.manim.community
Source: link.curiouswalk.com/manim
Thanks for watching.
🔗 www.curiouswalk.com
✉️ hello@curiouswalk.com
This video is produced with the animation engine Manim.
Manim - Mathematical Animation Framework. www.manim.community
Source: link.curiouswalk.com/manim
Thanks for watching.
🔗 www.curiouswalk.com
✉️ hello@curiouswalk.com
Просмотров: 731
Видео
Ellipses From Rolling Circles
Просмотров 1,1 тыс.Год назад
The Tusi couple is a mathematical device in which a small circle rotates inside a larger circle twice the diameter of the smaller circle. Rotations of the circles cause a point on the circumference of the smaller circle to oscillate back and forth in linear motion along the diameter of the larger circle. However, the points on the inner circle that are not on the circumference trace ellipses. T...
Koch Curve: The Beauty of Fractal Geometry
Просмотров 14 тыс.2 года назад
The Koch curve is a fractal curve constructed by recursively adding smaller equilateral triangles to each side of an initial equilateral triangle, resulting in an infinitely complex, self-similar shape. At each stage of construction, the curve has a finite length, but its total length becomes infinite as the number of iterations approaches infinity. The Koch curve stands out among other geometr...
Cycloid - The Brachistochrone Curve
Просмотров 17 тыс.3 года назад
The cycloid is a curve created by a point on the rim of a rolling circle defined by its parametric equations. It features periodicity, sharp cusps, and the property of being a tautochrone curve. Most notably, the cycloid is the solution to the brachistochrone problem, determining the path of quickest descent under gravity between two points. This discovery was crucial in the development of the ...
Manim Lesson: Updater Functions
Просмотров 6 тыс.3 года назад
This is a short lesson on Updater Functions of Manim. [source] gitlab.com/cw-manim/updaters This video is produced with the animation engine Manim. Manim - Mathematical Animation Framework. www.manim.community Manim Animation link.curiouswalk.com/manim Thanks for watching. 🔗 www.curiouswalk.com ✉️ hello@curiouswalk.com
Fibonacci Sequence | Spiral Animation
Просмотров 10 тыс.3 года назад
A short video of Fibonacci Sequence and The Golden Spiral. The voice over is done using speech synthesis from WellSaid. wellsaidlabs.com This video is produced with the animation engine Manim. Manim - Mathematical Animation Framework. www.manim.community Manim Animation link.curiouswalk.com/manim Thanks for watching. 🔗 www.curiouswalk.com ✉️ hello@curiouswalk.com
Merge Sort Algorithm
Просмотров 59 тыс.3 года назад
This video explains Merge Sort algorithm and visualizes the implementation process. The voice over is done using speech synthesis from IBM Watson Text to Speech www.ibm.com/cloud/watson-text-to-speech This video is produced with the animation engine Manim. Manim - Mathematical Animation Framework. www.manim.community Manim Animation link.curiouswalk.com/manim Thanks for watching. 🔗 www.curiousw...
Quick Sort Algorithm
Просмотров 249 тыс.3 года назад
Quick Sort is a sorting algorithm based on partitioning the array of data into sub-arrays to sort them recursively. This video is produced with the animation engine Manim. Manim - Mathematical Animation Framework. www.manim.community Manim Animation link.curiouswalk.com/manim Thanks for watching. 🔗 www.curiouswalk.com ✉️ hello@curiouswalk.com
Wonderfully made thank you so much, exam in 9 hours.
Thanks!
For future watchers/viewers • (dot) is the index position. [•] (dot in brackets) is the element at index • (dot) Comparing only the • dots means comparing the index positions of the • dots only and not the elements at • the dots. Thanks a lot, this video was the only one that helped me understand this algorithm. Much respect.
WOW!! The animation explains the sorting algorighm in easiest way!! Just wondering could you share the colab notebook code of that animation?
Alright! So how to merge them all in the end? I should maintain a map to hold each value at each index?
Great video, looks like I'm going to learn Manim
This does not handle duplicates if you check when you swap if current value == pivot
but... 0 is not greater than 5?
you boy makes this really easy........this 3 minutes are fascinating!
Awesome! Super! thank you!
wow youre like able to communicate from higher dimensions
I have watched so many videos on quick sort.but i didn't understand all of them, but this video makes me sense. and i have understood it very perfectly.
wow mindblowing this is a masterpiece
Code please......
Nice job!
criminally underrated content
great work
Perfect!
great explanation thanks alot
0:13 not the mindustry sound
7 to 6 in the third level, it dint exchange the value ?? y
Awesome video,🙌
the sounds effects are so satisfying lol nice vid
In one way or another now I totally get quicksort. thank you for the video.
nice animation, bad sounds. anyway like, it is clear
loovoly video mate thanks alot
0:32 why 2 is not swapped after +1 it will become 3 which is less than pv?? It need to swap
beautiful animation
Woah!!!! This was amazing dude. Keep making such videos :)
Actually there is an error in the drawn condition for swap green and orange, it should be inverted. At 0:45 it swaps 0 with 5, but according to condition 'green > orange' (0 > 5) it should not. So the correct condition is 'green < orange' (0 < 5). We are sorting ascending and not descending. ✌
It looks like this is not an issue. The green and red dots represent the indices in the array so 'green > blue' states that if green is at a higher index than blue then swap (not values!). Later once green is smaller than or equal to 4 (pivot) then the new incremented position of yellow is more than the pivot. If the new green element is less than the pivot then it is obviously less than the new incremented yellow value as well.
@@smartrabbitvideos9384 at the start of the video, the green and orange dots were said to represent element at index not index
@@eauploads3677 only if there is a bracket around it, if not then it represents the indices
@@eauploads3677 i saw that error too but after @smartrabbitvideos9384 reply I realised that dot with square brackets [dot] represents value and only dots represents index
what you said is correct
brother make more videos on Ds, might lead to boost 👍
Does there seem to be a problem at green > orange => swap ???
seems yes, I also noticed this and decided to read the comments if I am not missing something. this condition should be changed on opposite one.
Congratulations on this animation. I had never understood what the swap rule was like between current position value and swap position value. With this animation I understood that after increasing the exchange position by 1, its value must be exchanged if the value of the current position is less than that of the exchange position, this way the exchange position will always contain a value less than or equal to the value of pivot.
green dot is iterator.. like i in for loop. orange dot keep track of elements what are smaller than the pivet. steps: 1. select the pivet. (last element) 2. traverse through the array and compare each element with the pivet. if it finds element less than the pivet, move orange dot one place. then swap places.(this action move elements that are less than pivet, close to each other.) 3. if green dot goes to the pivet, then again move green dot one place and swap it with the pivet. now we have the pivet in place where it placed correct place it should be. do this recursively
Insanely good
This video is so underrated, amazing explanation!
This was crazy helpful, but I REALLY want to point something out. The graphic shows (🟢>🟠) ➡ ([🟢] swap [🟠] ). This is a typo. It should be < (less than), NOT > (greater than) I just spent a few hours debugging why this wasn't working.
isnt this insertion sort??!?!?!/
Insertion sort is way different and way slower but much simpler. Let’s say you have 4, 5, 1, 3 and 2. Then it repeats these steps for each element 1. If there’s no element to the left go to next element. 2. If the left element is greater than the current one swap and go back to step 1. Once that is done it’s sorted so for the sequence I mentioned earlier would change like this 4, 5, 1, 3, 2 -> 4, 5, 1, 3, 2 -> 1, 4, 5, 3, 2 -> 1, 3, 4, 5, 2 -> 1, 2, 3, 4, 5 the first two are the same because 4 has no left element and 4 is smaller than 5 so no swap happens.
Use technical services help people more understand technologies. thank so much
I love the sound effect thank you
finally found the gem.
Most amazing animation to explain quick-sort
How to make these kind of animations!
this doesn't work with multiple duplicate elements in an array, maybe someone can help me with 40420 I get stuck at 424 with pivot 4
LOL 🤣🤣🤣 luckily I didn't start with quicksort when I started coding
Thats wrong the picot is the median of three
The pivot can be any element of choice as searching for the optimal one is the same as sorting the elements so your idea will take the quick out of quick sort
I wonder if sunflower milk is actually a thing, lol. Sunflowers actually have an interesting spiral property to them related to the Fibonacci sequence. I think Numberphile has a video on it.
سبحان الله
Thanks man.
This is one of the best channel to learn computer science concepts in general.Please keep creating and posting more videos as these animations are highly useful in understanding the underlying concepts.Can you please share the manim code you used to create this animation.