Ya some basic concepts in short will be good and specially for quick revision specially this one most dev forget it as we never use this in most applications. If possible do make a playlist
@@CodingWithLewis could you make a vid about radix sort, if I remember correctly that is the fastest sorting algo there is and it would make an interesting video. :)
I learned bubble sort before getting into programming. I first used it in Pokemon Yellow, to sort my Pokemon. You could only sort one swap one pair of pokemon at a time, so bubble sort was the way you had to do it.
I think C is one of the best Languages because of its flexibility. There is literally nothing you can't write in C. For example i am really interestet in Computer architecture and for some concepts like Paging and MMIO it really just helped writing a small kernel to implement these concepts. Guess what Language i used besides Assembly.
After you put the 8 in the last spot you start comparing at the beginning again and you keep going until you get to the 5 and 4 to be switches. The way the animations shows, after 8 is placed it just goes straight to the 4 and 5. Which is wrong.
The simple way to write a code, is most of the best way to write your code. No one going to care about the code behind as long your program does not take too long to load.
@@Tmplar Yup, you are right, it's not optimal, but it's still made by me :) (and in place). Btw, bubble sort shown in the video is O(n^2), not O(nlogn)
@@rodrigoqteixeira Yeah, I just thought you were going for a new best (which is impossible btw). The absolute best for any sorting algorithm O(n log(n)). I’m not trying to beat you down btw, if you have it on github or something I’d like to check it out
First if you want to find the highest or lowest value, just go over it once. If you want to find the biggest N numbers you could create a max heap. A max heap is a binary tree with the condition, that every nodes parent is bigger or equal. That way you can gurantee, that the biggest value is on the top without having to completely sort the data. If you want to find the second biggest number, you remove the top node and replace it by one of his children. By definition, one of those children has to be the biggest new node. There even is a sort algorithm called heapsort, which creates a heap and extracts the top element till its empty resulting in sorted data.
@@labscience8271 thanks for the suggestion. What's a good introductory tutorial for python? Because I'm not out of school yet and I want to work on my portfolio ad fast as possible. Cheers!
@@daveeeeeeeeeeeeeeeeeeee I started with this tutorial from this legend on FreeCodeCamp: ruclips.net/video/rfscVS0vtbw/видео.html If you want to create basic GUI stuff, here is my second legendary tutorial: ruclips.net/video/YXPyB4XeYLA/видео.html They take +4 or +5 hours. Don't do it all on the same day or you'll forget everything. Also, take notes. Wish you a good start. Good luck!
New series :) What do you think? 🤔
Amazing!!
Ya some basic concepts in short will be good and specially for quick revision specially this one most dev forget it as we never use this in most applications.
If possible do make a playlist
Need more of these
I didn't even know that! 😅
Dude, your channel is one of the best cheatsheet on RUclips ever!
Please make a video on algorithms and data structures, it was one hell subject during my 2nd semester
Absolutely!
A video? Bro, isn't this the core of tech interviews. It would take a whole playlist 🥲
@@CodingWithLewis could you make a vid about radix sort, if I remember correctly that is the fastest sorting algo there is and it would make an interesting video. :)
Please
I learned bubble sort before getting into programming. I first used it in Pokemon Yellow, to sort my Pokemon. You could only sort one swap one pair of pokemon at a time, so bubble sort was the way you had to do it.
Great
This is such a good idea! Can you do the same with data structures?
maybe use it, then charge more for code improvement 💀
*This is business*
welcome to capitalism
bro is level 100 in the capitalist server 💀💀💀
I think C is one of the best Languages because of its flexibility. There is literally nothing you can't write in C. For example i am really interestet in Computer architecture and for some concepts like Paging and MMIO it really just helped writing a small kernel to implement these concepts. Guess what Language i used besides Assembly.
Plus, if you know C you can learn other languages more effectively
I play a game called 7 Billion Humans and honestly this is the only way I could figure out how to solve certain puzzles
After you put the 8 in the last spot you start comparing at the beginning again and you keep going until you get to the 5 and 4 to be switches.
The way the animations shows, after 8 is placed it just goes straight to the 4 and 5. Which is wrong.
Your videos are really helpful man👑Subscribed ❤️
The simple way to write a code, is most of the best way to write your code. No one going to care about the code behind as long your program does not take too long to load.
Thank you sir
I love these types of quickly explained alghoritms
We need more project ideas
Fun fact that bubble sort could be faster than other on small arrays ;)
Really needed this. Please also make merge sort, quick sort and hashing. As someone who is learning really appreciate this.
Absolutely :D
Hashes best way to go if you know the possible values. Binary sort if you don't
Please try covering the topics of Discreet Mathematics... It will be coming on my second semester..
Great idea. More please 😀
Ok I like this guy👍
I like the brief explanation
At first I was using Bubble Sort and getting TLE all over the places 😂
What’s the next best one then? I only know bubble sorting from school 😆
quicksort algorithm is the most efficient algorithm for sorting elements
Do you have playlist for algorithm in simple way
If i were five i would have lost it at the point where you said list of objects and algorithm and obama.
That's not explaining it like someone's five, that's just how you explain it. It's literally just that simple
Its almost like the concept is already simplified, and thats the point
2 for loops in C and u are done
Or even one
I literally made one faster stable sorting algorithm (O(n sqrt n)) when playing arround with a sorting algorithm showcaser.
But x sqrt(x) grows faster than x log(x)
@@Tmplar Yup, you are right, it's not optimal, but it's still made by me :) (and in place). Btw, bubble sort shown in the video is O(n^2), not O(nlogn)
@@rodrigoqteixeira Yeah, I just thought you were going for a new best (which is impossible btw). The absolute best for any sorting algorithm O(n log(n)). I’m not trying to beat you down btw, if you have it on github or something I’d like to check it out
Bogo bogo sort is theoretically the fastest, change my mind.
Pls how can you provide a video on how to learn and master algorithms and data structure to pass interview coding test
I have coded an efficient bubble sort in minecraft. But it's not my content. I couldn't upload it.
Bogosort best sort
Heap sort for the win. Worst case O(log n)
You forgot an n.
Sorting anything in logarithmic time would imply you can sort two objects by only looking at one.
Bad explonation: what is a value, an object, can it just sort numbers?
Wait…
Did the Google CEO not know that?
It's part of the 4th amendment that CEO:s get their algorithms from president. God bless Abraham Lincoln for creating the A* pathfinding algorithm
I prefer quick sort
Isnt it super useful for finding just the highest/lowest values in a huge amount of data? It only has to go through a few iterations then
First if you want to find the highest or lowest value, just go over it once.
If you want to find the biggest N numbers you could create a max heap.
A max heap is a binary tree with the condition, that every nodes parent is bigger or equal.
That way you can gurantee, that the biggest value is on the top without having to completely sort the data.
If you want to find the second biggest number, you remove the top node and replace it by one of his children.
By definition, one of those children has to be the biggest new node.
There even is a sort algorithm called heapsort, which creates a heap and extracts the top element till its empty resulting in sorted data.
I also said this when I was 5.
i mean, i didn't feel like i am five.
What's the best programming language to learn for a beginner? Because I've been thinking of starting for a long time I just don't know how to.
Python should be good. I started with Python and now I can program some decent stuff. Would highly recommend.
@@labscience8271 thanks for the suggestion. What's a good introductory tutorial for python? Because I'm not out of school yet and I want to work on my portfolio ad fast as possible. Cheers!
@@daveeeeeeeeeeeeeeeeeeee
I started with this tutorial from this legend on FreeCodeCamp:
ruclips.net/video/rfscVS0vtbw/видео.html
If you want to create basic GUI stuff, here is my second legendary tutorial: ruclips.net/video/YXPyB4XeYLA/видео.html
They take +4 or +5 hours. Don't do it all on the same day or you'll forget everything. Also, take notes. Wish you a good start. Good luck!
@@labscience8271 Thanks for everything!
@@daveeeeeeeeeeeeeeeeeeee No problem dude
Lol Bubble Sorting..leaned that back in 1987, sheesh they still teach that…?
Isn’t it a Shaker Sort when you change a direction of iteration?
Try Bogo Sort 😈
Part 2?
Obamium
Wait... I'm not supposed to use bubble sort? Oops
me who codes in python,
.sort()
What about bogosort
Then why not college Remove this topic 🙂
does Obama know prpgramming?
Do you know that algorithm made by arabic scientist his name Muhammad ibn Musa *al-Khwarizmi* before more thousand year
Your language is way too high level for ELI5. Its more like ELI12
I'm 9 not 5
If you're 5yo, I'm sure you don't know numbers yet. So comparing value won't mean anything to you. 🤣
Bogo sort
so which sort algo is the best ?
Mostly merge sort tends to be a better solution
Will be doing a series :)
The answer is.... it DEPENDS. All algorithms have pros and cons.
Bogo sort. Definitely.
What 5 year olds are you talking too?
this is not explanation of algorithms