Hi John don't worry about the views on your videos, you are putting out great content and I want you to know all of this will add up in near future for the students as well as for your channel!!
I'm not too worried - I've seen steady growth since starting the channel, and the growth gets a bit faster over time. But I certainly am impatient! I'd love to see it just explode at some point but that hasn't happened yet. I really appreciate you all for watching, and sharing with whomever you think might get some value out of the videos! You guys are awesome!
I was a little confused about how the 0th position would ever get currentValue, but I code traced it and it would since after j = 0 - > j = 0 - 1. So j would equal -1, which terminates the loop and then the currentValue would be added to inputArray[j + 1] which is (-1 + 1 = 0), so inputArray[0] = currentValue. Took me a minute.
I Was having a lot of trouble seeing how this comes together with just the examples from my textbook. This video made it very clear. Thank you for the work you do, you're an awesome educator!
I have been struggling with the three of the sorting techs (bubble/selection/insertion) from weeks. This video finally made me understand the difference in approaches between selection and insertion. Much love, thanks John
I remember watching your Java videos for the first couple of my java classes and now I'm watching them again to prepare for employment assessment shenanigans. Thank you.
Hey Jhon! No matter how much subscribers you may win, but you have definitely won lots of prayers and well wishes. You are helping many in an absolutely awesome way. You are contributing in society in real means. Thank you soo much. God Bless you! PS: I recommend your channel to every java mate I have.
Thank you! I´m working on a school project and have to code the world map and add sort types. Your video was really helpfull to understand how it was working and what I did wrong.
First video I've seen of yours and already liked and subscribed. Can't wait to watch the merge sort one. This is one of the most straight forward and clear instructions I've seen that takes you from the logic, to the build, and then even addresses the time complexity and actually shows it in such a clear way and all in 10 minutes! Amazing! Thank you for the content!
Hi! I love your videos, you are such a good teacher! You explain everything in a very logical and simple to understand way. Could you perhaps do a video on shell-sort?
Thanks a lot John for these videos! Every one of them is excellent. They have helped a lot in understanding algorithms and then coding. It would be great if you cover Heap Sort as well.
REALLY AWESOME EXPLANATION! I was a bit confused with this algorithm and as a last resort, tried watching this video, and believe what, you have made me very clear in this algorithm, I REALLY WANT TO SUBSCRIBE TO YOUR DSA COURSE, IF YOU HAVE ANY. please let me know .
Please do quicksort. PLEASE! And challenge: do it in your own style without passing in low, high, mid, etc index values as method parameters (just as you did with merge sort) :)
I am planning on quick sort for next week's video, so stay tuned! I'm still working on how best to explain it though, since I don't really like how it's presented in most other videos. I'll do it in my own style for sure. You do need those parameters for quick sort to work, but there might be a way to only need it inside the recursive part of the implementation and not where the main code calls it.
@@CodingWithJohn Beautiful! Looking forward to it. While we're on the topic, do you also have plans to cover things in Java like the collection framework, generics, reflection, etc? I'll be your fastest clicking subscriber if that is the case =)
Hey John congrats for the awesome content you're providing! I was wondering if your java bootcamp/class would be good for an intermediate java developper? And if yes, why? What ressources would you recommend as intermediate level for someone willing to learn by practising? Thank's a lot. Your videos are among the best on java in my opinion
Quick question: the time doesn't increase exponentially, does it? At 9:18, you say it "goes up exponentially". But the time complexity is squared, i.e it increases n^2. Exponential increase would be 2^n, right?
After the while loop shouldn't we write: inputArray[j ] = current value; Instead? Because in the while loop the value of the array at jth position is stored in j+1 Position meaning that 3 shift to the right and now we can update its previous index which is j with currentValue?
Thx a lot for this video! I have a question is J start from right to left? Sorry i am beginner and i have some difficulties to understand, it' s not about the video who is perfect. thx !!
Hey John, quick question. In the while loop, why do we put array[j+1] = array[j] rather than array[i] = array[j]. It means the same thing but it doesn't work when I use the latter method. Could you clear up my confusion. Btw, your videos are really cool and I recently subscribed to you!
Does anyone else find the colorful code distracting? I am use to the white only, it plainly allows me to focus on the code words unlike the colors with code.
It’s because they are fundamental algorithms that help you to study more complicated algorithms. Some programmers even create their own algorithms or implement the pseudocode algorithm written by someone else like a mathematician. So it’s good to be familiar with the basics.
![[FULL EP.73] เปิดบ้าน 70 ล้าน "แป้ง Zbing" ยกมาทั้งญี่ปุ่น l เคหสถานบานปลาย l One Playground](http://i.ytimg.com/vi/YBnJhTt07Pg/mqdefault.jpg)
Hi John don't worry about the views on your videos, you are putting out great content and I want you to know all of this will add up in near future for the students as well as for your channel!!
I'm sure he's not worried. He's aware his channel is new and how the algorithm / search recommendations contribute to cumulation of views.
I'm not too worried - I've seen steady growth since starting the channel, and the growth gets a bit faster over time. But I certainly am impatient! I'd love to see it just explode at some point but that hasn't happened yet.
I really appreciate you all for watching, and sharing with whomever you think might get some value out of the videos! You guys are awesome!
@@CodingWithJohn The best thing about running an education channel is that there will always be someone looking for what you're teaching.
@@CodingWithJohn is touch typing worthy for a programmer
@@CodingWithJohn
yeah your videos are brilliant in the making , I havent seen these related to java about few years ago
I was a little confused about how the 0th position would ever get currentValue, but I code traced it and it would since after j = 0 - > j = 0 - 1. So j would equal -1, which terminates the loop and then the currentValue would be added to inputArray[j + 1] which is (-1 + 1 = 0), so inputArray[0] = currentValue. Took me a minute.
Thank you! I had problems with this part too, now I get it.
was literally confused about this too, thanks for the comment
HUGE! much appreciated!
wow!, i also had the same problem, thanks mate
Thank you so much , was struggling on this part
Whenever I need a refresher or to help someone understand these concepts, I use this video. Top notch teaching!
I Was having a lot of trouble seeing how this comes together with just the examples from my textbook. This video made it very clear. Thank you for the work you do, you're an awesome educator!
I have been struggling with the three of the sorting techs (bubble/selection/insertion) from weeks. This video finally made me understand the difference in approaches between selection and insertion. Much love, thanks John
Hello John! I'm from Brazil and I'm praticing both Algorithms and English so your video helped me a lot. Thank you very much!
Your videos are top-notch and concise! I like your emphasis on understanding the algorithm or concept before diving into writing code.
I remember watching your Java videos for the first couple of my java classes and now I'm watching them again to prepare for employment assessment shenanigans. Thank you.
Good luck!
Hey Jhon!
No matter how much subscribers you may win, but you have definitely won lots of prayers and well wishes. You are helping many in an absolutely awesome way. You are contributing in society in real means. Thank you soo much. God Bless you!
PS: I recommend your channel to every java mate I have.
Preparing for an interview, you're helping alot! Thank you!
wow. this is really better than a paid course I have taken from Udemy. You are a TREASURE.
You are better than my professor in explaining the concepts and also the code. Keep the great work!
I love the way you explain these concepts, this is my favorite java tutorial channel by a country mile. Thanks!
lol kinda proud tbh ...i listened to your explanation and tried the code myself and it worked ... Thank you sir!
This video made me finally understand something I couldn't learn at all. Thank you!
Thank you!
I´m working on a school project and have to code the world map and add sort types.
Your video was really helpfull to understand how it was working and what I did wrong.
First video I've seen of yours and already liked and subscribed. Can't wait to watch the merge sort one. This is one of the most straight forward and clear instructions I've seen that takes you from the logic, to the build, and then even addresses the time complexity and actually shows it in such a clear way and all in 10 minutes! Amazing! Thank you for the content!
Hi! I love your videos, you are such a good teacher! You explain everything in a very logical and simple to understand way. Could you perhaps do a video on shell-sort?
I really like the way you showed the time complexity by running the tests. Great !
Thanks a lot John for these videos! Every one of them is excellent. They have helped a lot in understanding algorithms and then coding. It would be great if you cover Heap Sort as well.
Hi John, i'm appreciate what you are doing. I learned a lots from your videos, but can you do Insertion sort with Linked List? Thanks you
Yes, insertions and deletions of objects in a LinkedList would be great!!
REALLY AWESOME EXPLANATION!
I was a bit confused with this algorithm and as a last resort, tried watching this video, and believe what, you have made me very clear in this algorithm,
I REALLY WANT TO SUBSCRIBE TO YOUR DSA COURSE, IF YOU HAVE ANY. please let me know .
Watched a bunch of videos. This is the best insertion sort explanation. Thanks a lot. 💯
Thank u for this video.I have learnt insertion sort implementation very quickly.
best coding teacher we can have ❤🙌
easiest n clean explanation
Plz add more tutorials on various types of sorting and serching 👍
I will never forget it again. Thanks John Sir
You've helped me so much, thanks John!
What you're doing is great. Keep it up!
I love your videos!!!! they teach much more than college
Kindly do videos on BFS and DFS (Breadth-first search) in java
Thank so much Mr John
Please do quicksort. PLEASE!
And challenge: do it in your own style without passing in low, high, mid, etc index values as method parameters (just as you did with merge sort) :)
good idea hahah
I am planning on quick sort for next week's video, so stay tuned!
I'm still working on how best to explain it though, since I don't really like how it's presented in most other videos. I'll do it in my own style for sure. You do need those parameters for quick sort to work, but there might be a way to only need it inside the recursive part of the implementation and not where the main code calls it.
@@CodingWithJohn Beautiful! Looking forward to it.
While we're on the topic, do you also have plans to cover things in Java like the collection framework, generics, reflection, etc?
I'll be your fastest clicking subscriber if that is the case =)
Probably all of that, eventually!
@@CodingWithJohn thank you sooooooo very much for your lessons ! You are amazing !!!!! 👍👍👍👍🏆
Great stuff. Thanks for explaining in great detail
Thanks so much John, you made this very clear.
your the best teacher ever ...
Thanks a lot. Finally I understand it a bit better
This guy and his videos are so underrated
this vdo is a master piece
Thank you sir that was amazing
best explanation so far
Thank you for your time and effort. You help a lot of student
Beautifully explained
Thanks for another vid that you knocked out of the park 💪
Hey John congrats for the awesome content you're providing! I was wondering if your java bootcamp/class would be good for an intermediate java developper? And if yes, why? What ressources would you recommend as intermediate level for someone willing to learn by practising? Thank's a lot. Your videos are among the best on java in my opinion
Thank you uncle
Great explanation and very informative. Thank you.
Thank you!
Thank you John!!
Very good explanation, plus code.
Thank you Sir you made it simple👋
Hi John , Its really appreciable. Could you please upload videos of Heap sort please?
My request was answered. Thanks alot. 🤗🤗🤗
I love your videos!!!
Thank you
Quick question: the time doesn't increase exponentially, does it? At 9:18, you say it "goes up exponentially". But the time complexity is squared, i.e it increases n^2. Exponential increase would be 2^n, right?
this was very helpful!!!
Thanks John!
After the while loop shouldn't we write:
inputArray[j ] = current value;
Instead?
Because in the while loop the value of the array at jth position is stored in j+1 Position meaning that 3 shift to the right and now we can update its previous index which is j with currentValue?
Same doubt? Did you got it?
Thx a lot for this video!
I have a question is J start from right to left?
Sorry i am beginner and i have some difficulties to understand, it' s not about the video who is perfect.
thx !!
Hey John, quick question. In the while loop, why do we put array[j+1] = array[j] rather than array[i] = array[j]. It means the same thing but it doesn't work when I use the latter method. Could you clear up my confusion. Btw, your videos are really cool and I recently subscribed to you!
Omg, you idiot past self me, they are two different iterators! Gosh, I was so naive!
You're amazing😍😍💯
i find selection sort easier to understand than insertion sort. God knows why
Great video ;) would you like to do video about generic types?
can you do this video with recursion
Can you do a video on heap sort
Thanks!! great video.
how do you use printArray()? to print an array?
would u send some references to that? or make a video to explain how it works
private static void printArray( int[] inputArray) {
for (int i=0; i
private static void printArray(int [] arr) {
for(int num : arr) {
System.out.print(num + " ");
}
System.out.println();
}
Next one on quicksort please
The issue is that this code prints duplicate numbers, so it does not really sort the array of numbers
Does anyone else find the colorful code distracting? I am use to the white only, it plainly allows me to focus on the code words unlike the colors with code.
I want to know how gravity sort is implemented.
Jesus christ i cried when i saw this video...saved my ass for a DS exam
❤
Good video❤🎉🎉🎉🎉😂😂😅😊
Vallah
So You are still coding in eclips? :D
Check out the more recent videos!
U could have started comparing the number from beginning to its current index. That will be more faster. If I am right anybody please say
Made an exact copy of this
It doesn’t work
Just out of curiosity can someone give me an example where i would need to sort 1 Million or more Items ? xD
i dont know why we need to this. as these methods already provided by the language
It’s because they are fundamental algorithms that help you to study more complicated algorithms. Some programmers even create their own algorithms or implement the pseudocode algorithm written by someone else like a mathematician. So it’s good to be familiar with the basics.
Hi John , I ran your code and I got a Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: can anyone help?
you iterated out of range of the array. Either decremented to less then 0 or incremented to more then the array size
Many thanks