In case you are wondering why I didn't talk about "Big O" or whatever, it is just because I don't know too much about it myself and didn't want to misinform anyone :( Edit: narrative mistake in the video, bubble sort and insertion sort and selection sort loop through the array up to n^2 times, where n is the number of array elements. Somehow I said it loops through it twice :s
n is the number of calculations necessary. If you have to crosscheck each element with itself, you will have n*n or n^2. It helps suggest a measure of efficiency, and makes it easier to notice how some approaches do a fraction of the tests but yet are equally precise
Hello, I'm sure you know this and it was just a mistake, but you said stuff like "Bubble sort goes through the array twice" which isn't actually true, it goes through N^2 times (Hence O(N^2)) Pretty cool video seeing how I've looked at most of these sorting algorithms a few years ago and am now doing a course that uses Swing. Clarification edit: N is the number of elements in the array/size of array
No it doesn't, it depends on the input. Average case runtime complexity is O(n^2) but best case where the numbers are close to their sorted location is O(n). It's input dependent and can be really quick and cache efficient.
Well we were 'taught' (yey for self research) it but I felt it was pretty counter intuitive and docs didnt really help. Have not used swing though so cant say which experience is better :/ Glad to know that it is not usually the case =)
Having worked with JavaFX and Swing, I vastly prefer Swing. Plus, in the real world, most Java desktop applications are Swing, not JavaFX. JavaFX is very rarely used (in my experience).
Weird, literally just last night I was watching a "15 Sorting Algorithms in 6 minutes" video, did something similar to this. Cool to see how it all works :)
hey! awesome video! I've been trying to find a way to write a sort algorithm visualizer for awhile now and your solution with the "sleep swap" is really cool! This helped a bunch, thanks
Bogosort is best sort. For anyone unfamiliar: Bogosort: Shuffle a deck of cards. Ok, is the deck sorted? If not, shuffle it again and check again. Repeat until it is sorted.
Very inspiring, I wish I could go to uni and learn this stuff, instead of having to scrounge through youtube vids and stack overflow for quality information
I would just save all the steps of the algorithm to a file and then play the animation at a by the user specified speed. I have almost never found a good example where you have to use sleep. In most cases there is another way to do it and it almost always is better. Very nice video though. Some very nice editing and visuals.
thanks. and I did look into alternative ways (aka not using nanotime, or Thread.sleep like I do since making this video) but I could not find one unfortunately :(
Cool visualizer, but one question, why do you keep the CPU busy with stuff while sleeping? (I mean a while(sleep) loop is basically just keeping the CPU hat max usage). A simple System.sleep(mstosleep) call could have helped too. (But i could be wrong) Edit: Anyway also thanks for these kind of things. I never touched that before and its a valueable source to learn from :3
thanks and it I am no sure why, but I was getting InterurppedExceptions (Or something) when doing Thread.sleep, so I looked up alternate ways. Since editing that bit, I eventually did change it to Thread.sleep and it works fine now lol
BubbleSort is NOT useless. First of all you must check if during a run a swap happened an if not stop (there are other implementations). If the numbers you are sorting are almost at the right location you get away with a runtime of O(n). The runtime of BubbleSort can best be illustrated by locating the smallest number in the array. The farther it's close to the end the more quadratic the runtime is, because it needs one complete run to move the number one step to the left side of the array.
Hello, very good codes i love it. But please is there a way to print the time elapsed by each sorting algorithms? And also to see the different random numbers that are sorted on the graph?
Hello :) Read your code, though I cant see how you handled resizing events. I also want the bars to take the whole width of the application everytime it is resized.
How'd you think of the sleepfor method? Everywhere online, people always spam "to use a swing timer." Did you watch any tutorial or anything to figure it out?
Don't remember, but looking at it now, nearly 3 years on, it is far from an ideal solution as it is a spinlock. This means it just loops until some condition is met, which wastes CPU time. A much better solution would be to sleep the thread www.journaldev.com/1020/thread-sleep-java#:~:text=sleep%20in%20Java-,Thread.,negative%2C%20else%20it%20throws%20IllegalArgumentException%20.
@@Hopsonn I have a question if you don't mind answering. When ever I use thread.sleep, my screen goes white. It's probably because it's using the same thread to display it. How did you get around it, if you do remember. Thank you for your time.
depends. C++ and Java have quite opposite philosophy: C++ is fully compiled, and is going to do everything for those sweet performances. It has a very basic standard library, but tons of library. It's not as cross-platform as Java, but it's only getting better and better. Java is more about patterns and high level abstractions. It's quite slow to be honest, but only game developers care. It has a huge standard library, wich mean good stuff out of the box, but also means loads of long dead modules trapping new devs. I gotta admit, I'm not a big fan of Java, and I'm a 100% biased toward C++, so take it in account ... Overall, I do believe that learning C++ is a very good experiences : it makes you think about what is actually happening on your computer when you code, nothing is "hidden away". On the other hand, great powers implies great responsibilities, and it's easy to get into old C unending mess of weird pointers: if you learn C++, you should definetly keep up to date with the last updates and the good practices (auto, smart pointers, iterators, explicit override, move vs copy, etc. ) Note: my english is probably a bit weird, hope you don't mind
@@leleo53000 but Java is incredibly fast for what it does. Way faster than most GC enabled languages which run in a virtual environment. However, I like how you explain languages. I think languages are tools, if you only know one language, and cant switch to another rather quickly, then you probably aren't that much of a programmer.
Say you had a data set that you wanted to search often. It would be better to use a binary search on this as it is much quicker. However to use a binary search you need to have the data sorted, this is where you would use a sorting algorithm. You send all the data through the algorithm and what comes out the other side is your data in the correct order.
You probably use sorting algorithms all the time without realising it. A common example would be online shopping, where you can sort the products by price low to high. This would be done using sorting algorithms.
@@maxjordan3009 I guess if you are doing a search often you would sort the list and then use binary search, but if you are not doing that many searches it would be better to just do linear search on a non sorted list because the big o would be O(n), compared to sorting which would be O(nlogn) + O(logn) which simplifies to O(nlogn) which is less efficient.
But yeah, I have tried IntelliJ and didn't like it. Saying it is "a better IDE" is subjective, and not fact. People use what they prefer, I just happen to prefer netbeans.
@@Hopsonn Well I don't know what disk drive do you use, or what else slows down your launch time, mine loads in like 5-10 seconds, both on Windows and Ubuntu. Also do note that you don't close and reopen an IDE constantly, unlike a text editor (which is a valid reason not to use Atom lol) As for your second reply: I'm just recommending IntelliJ based on my own experience. I liked the inspections, code completion, it just helps in making your code better.
In case you are wondering why I didn't talk about "Big O" or whatever, it is just because I don't know too much about it myself and didn't want to misinform anyone :(
Edit: narrative mistake in the video, bubble sort and insertion sort and selection sort loop through the array up to n^2 times, where n is the number of array elements.
Somehow I said it loops through it twice :s
Talk*
Keep up the great work!
For anyone watching wanting a quick intuitive explanation, here _n_ is the array size and _O(f(n))_ describes how the algorithm scales with array size
n is the number of calculations necessary. If you have to crosscheck each element with itself, you will have n*n or n^2. It helps suggest a measure of efficiency, and makes it easier to notice how some approaches do a fraction of the tests but yet are equally precise
@@CharIie83 yeah that's pretty much it, but I still don't think I would be very good at explaining that in the video lol
You editing skills are improving, nice video
Insertionsort is O(n^2) not O(2n)! That means you iterate n times over the whole array not only 2 times.
Oops, my mistake
Nobody mentioning the Donkey Kong Counrtry 2 Aquatic Ambeience in the background.
Great video and song choice
Hello, I'm sure you know this and it was just a mistake, but you said stuff like "Bubble sort goes through the array twice" which isn't actually true, it goes through N^2 times (Hence O(N^2))
Pretty cool video seeing how I've looked at most of these sorting algorithms a few years ago and am now doing a course that uses Swing.
Clarification edit: N is the number of elements in the array/size of array
Yeah you're right, no idea how I made that mistake in the video :s
No it doesn't, it depends on the input. Average case runtime complexity is O(n^2) but best case where the numbers are close to their sorted location is O(n).
It's input dependent and can be really quick and cache efficient.
It's a shame universities don't teach the newer JavaFX framework. I've used both Swing and JavaFX and I much prefer the latter.
JavaFX isn't part of the core JDK anymore as of JDK11
ooo ooo I wonder why that is. Especially considering fx was meant to replace swing.
Well we were 'taught' (yey for self research) it but I felt it was pretty counter intuitive and docs didnt really help. Have not used swing though so cant say which experience is better :/
Glad to know that it is not usually the case =)
Swing is absolutely part of JDK 11. See here: download.java.net/java/early_access/jdk11/docs/api/java.desktop/module-summary.html
Having worked with JavaFX and Swing, I vastly prefer Swing.
Plus, in the real world, most Java desktop applications are Swing, not JavaFX. JavaFX is very rarely used (in my experience).
Background music gave your video a real Bisqwit vibe. Well done.
Weird, literally just last night I was watching a "15 Sorting Algorithms in 6 minutes" video, did something similar to this.
Cool to see how it all works :)
hey! awesome video! I've been trying to find a way to write a sort algorithm visualizer for awhile now and your solution with the "sleep swap" is really cool! This helped a bunch, thanks
I really like the explanations.
Very Nice Video Hopson. Nice intro to time complexity.
I am missing bogosort :(, Otherwise great video!
Bogosort is best sort. For anyone unfamiliar:
Bogosort: Shuffle a deck of cards. Ok, is the deck sorted? If not, shuffle it again and check again. Repeat until it is sorted.
Best case scenario, it is the most efficient one, so yes, I would recommend everyone use it.
i use bogo sort on gigantic arrays. fight me
Just programmed an insertion sort algorithm yesterday 😂
Very inspiring, I wish I could go to uni and learn this stuff, instead of having to scrounge through youtube vids and stack overflow for quality information
selection sort killed it
damn
sorting algorithms FeelsGoodMan Clap
S OMEGALUL RTING ALG OMEGALUL RITHMS
are you familiar with Processing? what can you say about it if you are?
Never used it, but I have seen some videos on The Coding Rainbow's channel, looks decent.
The Coding Train xD. Good video 🔥
Bubblesort ist the best.
It really is in the case that you have a huge amount of data, and only some data changes locally.
Bubble sort sucks
Really cool stuff !
Thanks for the video!
Awesome!
I love this channel.
I would just save all the steps of the algorithm to a file and then play the animation at a by the user specified speed. I have almost never found a good example where you have to use sleep. In most cases there is another way to do it and it almost always is better. Very nice video though. Some very nice editing and visuals.
thanks.
and I did look into alternative ways (aka not using nanotime, or Thread.sleep like I do since making this video) but I could not find one unfortunately :(
Smetana!! Vltava/Moldau, You listen to classical?
Cool visualizer, but one question, why do you keep the CPU busy with stuff while sleeping? (I mean a while(sleep) loop is basically just keeping the CPU hat max usage).
A simple System.sleep(mstosleep) call could have helped too. (But i could be wrong)
Edit: Anyway also thanks for these kind of things. I never touched that before and its a valueable source to learn from :3
thanks
and it I am no sure why, but I was getting InterurppedExceptions (Or something) when doing Thread.sleep, so I looked up alternate ways. Since editing that bit, I eventually did change it to Thread.sleep and it works fine now lol
lol ^^ Yeah it requires a Try catch around it to be save.
But yay.
Dammit Hopson, I was making this and you just beat me to it :(
BubbleSort is NOT useless. First of all you must check if during a run a swap happened an if not stop (there are other implementations). If the numbers you are sorting are almost at the right location you get away with a runtime of O(n). The runtime of BubbleSort can best be illustrated by locating the smallest number in the array. The farther it's close to the end the more quadratic the runtime is, because it needs one complete run to move the number one step to the left side of the array.
Hello, very good codes i love it. But please is there a way to print the time elapsed by each sorting algorithms? And also to see the different random numbers that are sorted on the graph?
Hello :) Read your code, though I cant see how you handled resizing events. I also want the bars to take the whole width of the application everytime it is resized.
Could one of these algorithms be used for preventing 3D polygons from overlapping?
It doesnt repaint when i swap, what can be the issue?
How'd you think of the sleepfor method? Everywhere online, people always spam "to use a swing timer." Did you watch any tutorial or anything to figure it out?
Don't remember, but looking at it now, nearly 3 years on, it is far from an ideal solution as it is a spinlock. This means it just loops until some condition is met, which wastes CPU time.
A much better solution would be to sleep the thread
www.journaldev.com/1020/thread-sleep-java#:~:text=sleep%20in%20Java-,Thread.,negative%2C%20else%20it%20throws%20IllegalArgumentException%20.
@@Hopsonn thank you so much! replying to a comment on an old video shows how much dedication you put on your youtube channel. Thank you!!!
@@Hopsonn I have a question if you don't mind answering. When ever I use thread.sleep, my screen goes white. It's probably because it's using the same thread to display it. How did you get around it, if you do remember. Thank you for your time.
does anyone have a guide or a tutorial for this project
W0rthy's array vizulizer can sound painful sometimes
Do Bogo sort and Miracle sort ;)
Not Rust? (((
please please release a tutorial for building this..
Should I stop learning C++ as my main language?
Every language have pluses and minuses, and every language is tool. Use correct tool in correct problem.
nah, C++ is still widely popular (if it ins't the most popular), you should still learn other languages
depends.
C++ and Java have quite opposite philosophy:
C++ is fully compiled, and is going to do everything for those sweet performances. It has a very basic standard library, but tons of library. It's not as cross-platform as Java, but it's only getting better and better.
Java is more about patterns and high level abstractions. It's quite slow to be honest, but only game developers care. It has a huge standard library, wich mean good stuff out of the box, but also means loads of long dead modules trapping new devs.
I gotta admit, I'm not a big fan of Java, and I'm a 100% biased toward C++, so take it in account ...
Overall, I do believe that learning C++ is a very good experiences : it makes you think about what is actually happening on your computer when you code, nothing is "hidden away". On the other hand, great powers implies great responsibilities, and it's easy to get into old C unending mess of weird pointers: if you learn C++, you should definetly keep up to date with the last updates and the good practices (auto, smart pointers, iterators, explicit override, move vs copy, etc. )
Note: my english is probably a bit weird, hope you don't mind
@@leleo53000 but Java is incredibly fast for what it does. Way faster than most GC enabled languages which run in a virtual environment. However, I like how you explain languages. I think languages are tools, if you only know one language, and cant switch to another rather quickly, then you probably aren't that much of a programmer.
@@leleo53000 Since my first language was Java I always miss things of the standard libraries of most languages, the big one is always the gui
Please make a new video on ASCIIMON !
lol, Molau in the background
Nice
So do you learn Java swing?
We just got told:
Use this.. thats it xD
They didn't even tell us the name of the framework at my university ._.
What text editor and compiler did you use?
Netbeans ide and oracle jdk
Hopson thanks, you inspires me
What was the sorting algorithm just before the video ended?
first one was merge, second was quick sort
Hopson That was soo fast, if you blink you miss it.
Why did you not use LWJGL? (The API of Minecraft)
Why are you using Netbrains instead of IntelliJ
So, what do you need this for? i didnt really understood it
Say you had a data set that you wanted to search often. It would be better to use a binary search on this as it is much quicker. However to use a binary search you need to have the data sorted, this is where you would use a sorting algorithm. You send all the data through the algorithm and what comes out the other side is your data in the correct order.
You probably use sorting algorithms all the time without realising it.
A common example would be online shopping, where you can sort the products by price low to high. This would be done using sorting algorithms.
Well, didnt knew that they do that with an sorting algorithm
@@maxjordan3009 I guess if you are doing a search often you would sort the list and then use binary search, but if you are not doing that many searches it would be better to just do linear search on a non sorted list because the big o would be O(n), compared to sorting which would be O(nlogn) + O(logn) which simplifies to O(nlogn) which is less efficient.
Yeah thats true, was just the first example I could think off from the top of my head.
How did you learn to program?
ruclips.net/video/0Sk76NZcd84/видео.html
Is it possible to create a web with vizualuzs algorithms?
It is, you can use JavaScript with the canvas API
developer.mozilla.org/en-US/docs/Web/API/Canvas_API
developer.mozilla.org/en-US/docs/Web/API/Canvas_API/Tutorial
@@Hopsonn yayayay thank u....
"""Simple""", at least for me
Did you go to some university, and if you did, where?
I think its uni
Why you didn't use c++ and sfml?
As said in the video, I wanted to practice using Swing for university :P
Hello~!
it would be nice if you didn't have the entire first part on like x25 speed lmao
Hi guys, i'm having trouble with this:
stackoverflow.com/questions/62079995/sorting-visualization-with-quick-sort
hello
Post bogosort
why don't you use a better IDE, like IntelliJ IDEA? NetBeans is really old and outdated.
Nah mate, Notepad is where its at ;)
Why don't use a better IDE, like Netbeans? IntellJ is really slow and takes 30 minutes to load up.
But yeah, I have tried IntelliJ and didn't like it.
Saying it is "a better IDE" is subjective, and not fact. People use what they prefer, I just happen to prefer netbeans.
@@Hopsonn Well I don't know what disk drive do you use, or what else slows down your launch time, mine loads in like 5-10 seconds, both on Windows and Ubuntu. Also do note that you don't close and reopen an IDE constantly, unlike a text editor (which is a valid reason not to use Atom lol)
As for your second reply: I'm just recommending IntelliJ based on my own experience. I liked the inspections, code completion, it just helps in making your code better.
I was joking lol, you had some silly comments on netbeans, so i gave silly comments on intellij
S O R T I N G A L G O R O T H M
Merge sort is far from the best.
A
Great poem
Java makes me sad :(
damn that takes too much logic i think front end web development is enough for me
Its called boilerplate. And yes you're right. It gives you the ability the create efficient code though.
netbeans? really bro?
Yes. Problem?
why not intellij?
because i prefer netbeans
netbeans is too gay
It'd have been good if you have explained the video slowly, only just typing code 🤮
"""Simple"""