Your explanations & animations are very clear & concise, so YEAH! Especially with the most used DSAs in professional scenarios --not just academical scenarios.
When we learned about bubblesort in c lessons I really hated how slow it was so I tried to improve it, ending up with mergesort. I know this is nothing but I'll never forget how happy I was reinventing the wheel without reading about it elsewhere to the point this was almost 20 years ago but I clearly remember every detail -code was complete jank-
i have a similar story. once a teache asked the students to get a list of numbers, create a binary tree, then get the values sorted, it was all fun until we had to process a HUGE amount of numbers, 10% of class didn't made it, and 90%(including me) was geting stack overflow due the amount of recursive call. i was the only one(and others students that copied my solution) who was able to bypass this erro by modify the algorithm to use single call with loop instead of recursive call
I just wanted to say this is one of the best videos I have watched for a topic like this. I wanted to learn something while I ate some food and this was really insightful and informative. Also straight to the point. I also really liked all of the graphics and the way you explained everything quickly and throughly.
@@CodingWithLewis I don't know how to post it, but here is how it works: It seperates it into pairs, and then sort the pairss. All the data is then organized as pairs again but the pair combination is moved 1 number to the right. It keeps repeating between these two so 4, 1, 2, 5, 3 would become (4, 1) (2, 5) (3) Sorts into (1, 4) (2, 5) (3) Then it shifts to become (1) (4, 2) (5, 3) Which is then sorted into (1) (2, 4) (3, 5). Repeat the first step and becomes (1, 2) (3, 4) (5) When it is sorted it is then output.
5:55 "Heap is a tree-based data structure where all levels are filled except the lowest and is filled from the left to right." This is true but what's with the visual going against that definition? the 4 should be the left child node of the 3, shouldn't it? otherwise it's not being filled from the left lol
This is a really good video as a refresher because of its concise descriptions and neat visualizations, while also being entertaining with witty remarks about the algorithms
I thought bubble sort was a pom pom gun that points at a lower pigeonhole when the pom pom is heavy, and the upper pigeon holes when the pom pom is light.
9:59 In verbose, radix sort has a big Oh of the product of the number of numbers in the largest number and the sum of the number of numbers and the base of the largest number.
Forgot about DontSort: function DontSort(arr) { let newArr = new Array(arr.length).fill(null); for (let i = 0; i < arr.length; i++) { let randomIndex = Math.floor(Math.random() * arr.length); while (newArr[randomIndex] !== null) { randomIndex++; if (randomIndex>= arr.length) { randomIndex= 0; } } newArr[randomIndex] = arr[i]; } return newArr; } In rare cases, DontSort will fail and actually return a sorted list.
I am going through python documentation it still uses tim sort in 3.12. can you share any documents showing python using other sorting (power sort) in 3.12 ?
You didn't show the sorting graphic for Counting sort or Radix sort. Not necessarily necessary, but I think it would be both hilarious and helpful to see the poor performance of both of those algorithms illustrated 🤣
Hi I wanna add an e-commerce store app for my portfolio. I wonder which react stack is solid for it in 2024. Can someone suggest something? As a back I would prefer Firebase, also for styling scss+mui but need recommendations about state manager and other technologies and tools. Thanks!
![ARGENTINA vs. BOLIVIA [6-0] | RESUMEN | ELIMINATORIAS SUDAMERICANAS | FECHA 10](http://i.ytimg.com/vi/C3wPtKNbAOA/mqdefault.jpg)
Let me know if you guys want me to go more in depth with these types of videos :)
yesss plz do search algorithm
Yes please
Your explanations & animations are very clear & concise, so YEAH!
Especially with the most used DSAs in professional scenarios --not just academical scenarios.
Yes please
DSA question solving with great approach to fit In mind
When we learned about bubblesort in c lessons I really hated how slow it was so I tried to improve it, ending up with mergesort. I know this is nothing but I'll never forget how happy I was reinventing the wheel without reading about it elsewhere to the point this was almost 20 years ago but I clearly remember every detail -code was complete jank-
Thats why its awesome to learn bubble sort! So you know to improve it!
I have the same story except I ended up with shell sort 😅
i have a similar story.
once a teache asked the students to get a list of numbers, create a binary tree, then get the values sorted, it was all fun until we had to process a HUGE amount of numbers, 10% of class didn't made it, and 90%(including me) was geting stack overflow due the amount of recursive call. i was the only one(and others students that copied my solution) who was able to bypass this erro by modify the algorithm to use single call with loop instead of recursive call
this resourcefulness is what separates an engineer from a developer
You have such a knack for explaining things clearly. Awesome job!
I appreciate that!
my man lewis making gold content. every video and short is a hit man. keep up the awesome work
This video is not getting enough love! The way you made this entertaining while sharing real information on sorting algorithms is crazy good.
I just wanted to say this is one of the best videos I have watched for a topic like this. I wanted to learn something while I ate some food and this was really insightful and informative. Also straight to the point. I also really liked all of the graphics and the way you explained everything quickly and throughly.
I made a sorting algorithm in Excel! It's really easy and I call it Neural Sort!
Post it
@@CodingWithLewis I don't know how to post it, but here is how it works:
It seperates it into pairs, and then sort the pairss. All the data is then organized as pairs again but the pair combination is moved 1 number to the right. It keeps repeating between these two so
4, 1, 2, 5, 3 would become (4, 1) (2, 5) (3)
Sorts into (1, 4) (2, 5) (3)
Then it shifts to become (1) (4, 2) (5, 3)
Which is then sorted into (1) (2, 4) (3, 5).
Repeat the first step and becomes (1, 2) (3, 4) (5)
When it is sorted it is then output.
Did you use a filter or something 😅
@@dushalkumar No it isn't. You need to compare values.
great work dude :)
You are telling me that you did not talk about bogo sort????
I got another vid coming :) dont you worry
@@CodingWithLewisPhew, thanks
Man love the vibe of your videos👌 Feels more and more cinematic
My favourite sorting algorithm is still Stalin Sort.
Stay tuned 😎
How does it work? Eliminate all elements except one that pleases you and then define the problem to be solved?
What about Mao ZeSort?
We need a "The artist sort"
I have watched other people like Brocode and others. But you helped me understand them. Thank you so much!
5:55 "Heap is a tree-based data structure where all levels are filled except the lowest and is filled from the left to right." This is true but what's with the visual going against that definition? the 4 should be the left child node of the 3, shouldn't it? otherwise it's not being filled from the left lol
We want more of Data structure and algorithms video ❤
This is a really good video as a refresher because of its concise descriptions and neat visualizations, while also being entertaining with witty remarks about the algorithms
Finally a new long form video
I would love if u get more in depth in these, very interesting video!
Now make one which will Sort these sorting algos as per requirement.
amazing lewis! I only knew about some of them lol
If you can sort integers, you can sort colors. Black = 0x000000, Blue = 0x0000FF, Green = 0x00FF00, Cyan = 0x00FFFF, etc.
Quick sort with pivot: median of(first, middle, last element)
Go ahead and try beat it's performance.
Great Video, We need more like this from you
*correction* the best case doesn't called Big O it's called Omega, and if it's both equal it's called Theta , thanks for the effort
I thought bubble sort was a pom pom gun that points at a lower pigeonhole when the pom pom is heavy, and the upper pigeon holes when the pom pom is light.
THIS IS SO UNDERRATED! Wish my CS profs explained like that! Love from India
i feel like improvement to the visuals couldve made this a lot more easier to understand
9:59 In verbose, radix sort has a big Oh of the product of the number of numbers in the largest number and the sum of the number of numbers and the base of the largest number.
It would be perfect if you provide code for those kind of algorithms
Personally as an intellectual I prefer bogo sort
Forgot about DontSort:
function DontSort(arr) {
let newArr = new Array(arr.length).fill(null);
for (let i = 0; i < arr.length; i++) {
let randomIndex = Math.floor(Math.random() * arr.length);
while (newArr[randomIndex] !== null) {
randomIndex++;
if (randomIndex>= arr.length) {
randomIndex= 0;
}
}
newArr[randomIndex] = arr[i];
}
return newArr;
}
In rare cases, DontSort will fail and actually return a sorted list.
Imagine! If we get the complete DSA list from this guy 🙄
Great video! I still don't understand shell sort though.
YAAY NEW VID! 🎉
Told ya!
@@CodingWithLewis When we will get an Discord community server, also are you going to teach your child how to write own chatgpt.
Bogo sort stays unmatched
HOLD UP. what the F! why your views are so low I remember each of your videos has over like 1M view??
Haha none of my videos have over 1M views!
@@CodingWithLewis My man I wish you all best in the world you really working hard on your videos!💛👏
yeah right!? I also remember his videos has over 1M views damn thats crazy 5K on such a well-done video like this, youtube algo is wild
@@jlio2003 hey! If you guys like it that’s all that matters :)
best video compact and easy to understand
Glad you think so!
Thanks for the video.
Which sorting algorithm do you use the most?
I've been using merge sort!
Love it
1:11 quadratic, not exponential
I am going through python documentation it still uses tim sort in 3.12. can you share any documents showing python using other sorting (power sort) in 3.12 ?
You didn't show the sorting graphic for Counting sort or Radix sort. Not necessarily necessary, but I think it would be both hilarious and helpful to see the poor performance of both of those algorithms illustrated 🤣
Hi I wanna add an e-commerce store app for my portfolio. I wonder which react stack is solid for it in 2024. Can someone suggest something? As a back I would prefer Firebase, also for styling scss+mui but need recommendations about state manager and other technologies and tools. Thanks!
At 8:24 is shell sort O(n log n) or O(n2)
Bro is him.....
2:25 "exponentially"?
lewis are you ok you look like you don't want to live anymore in the thumbnail 😥😥
The algorithms are getting to me
Should’ve done BOGO sort and shown a visual for that! 😂
i still cant understand counting sort
I inspired by you
:D
What is bucket sort
all these algorithms for sorting numbers!!!!!!!!!!!!!!
We have to do it somehow!
Where is the Bogo sort?
Got another video coming :)
what about search algorithms like this video made it
True programmers use BOGO sort. Remember kids, Gamblers quit before hitting a jackpoint.
Here from discord
That fast
@@CodingWithLewis you send it out for a reason
Ticket to ride :D
the first man to watch😎
Wait real quicksort don't use new created list.
It just use the same list.
AFAIK
goat
the sound from the beginning of this video is from ruclips.net/video/kPRA0W1kECg/видео.html
Gott es ist so traurig wenn ich jeden einzelnen verstehe.
ruclips.net/video/kPRA0W1kECg/видео.htmlsi=BG8WVl4R_kBzZd6l 0:20 kinda looks similar to the thumbnail🤔🤔🤔🤔🤔