Hey guys! Sorry for lack of uploads lately, hopefully this 20 MINUTE comprehensive guide to algorithms makes up for it a bit! Please like and share with friends, I worked really hard on it and want it to help lots of people!
@ReluctantSpirit
6 ай бұрын
This video is one of the finest and well defined educational video on algorithms.
@ClashClash89
2 ай бұрын
Amusing footnote on the travelling salesman problem: The Japanese used a mushroom to map out an optimised solution for their railway network, by using oat flakes as „stations“, and the mycelial strings that grew the strongest where those linking the „stations“ with the shortest possible route. Bio-computer solving the problem via nutrient-gradient.
@tahirabatool2763
2 ай бұрын
Hello I would like to suggest something, the colors in this video were not very "popping" lets call it. In the video you have shown multiple times a binary tree where a few nodes are light purple and a few nodes are dark purple. I would like to suggest that you make the dark nodes more dark so as to make sure the color difference is able to be seen easily. You really have to concentrate to view them. Also Could you make a dedicated video to Binary Trees next? That would be a great help for me
@shadowrl7637
7 ай бұрын
Algorithms Binary Search: - Used to find a specific element in a sorted list efficiently. - Inefficient: O(n) for linear search, incrementally guessing from start to end. - Efficient: O(log2(n)) for binary search, repeatedly dividing the search interval in half until the correct element is found. Depth-First Search (DFS): - Begins at the root node and explores as far as possible along each branch before backtracking. - Utilizes a visited array to track already visited nodes. - Continues backtracking until all nodes are visited. - Real-life example: Solving a maze by systematically exploring paths until the exit is found. Breadth-First Search (BFS): - Looks at every node at one level before going down to the next level. - Utilizes a visited array to track already visited nodes and a queue to keep track of neighbors. - Begins at the root node and adds it to the visited array and all its connected nodes to the queue, then continues to explore nodes level by level. - Real-life example: Chess algorithms predict the best move by exploring possible moves at each level of the game tree. - Runtime: O(V + E), where V is the number of vertices and E is the number of edges. Insertion Sort: - Examine’s each element in the list, comparing it with the previous elements and shifting them to the right until the correct position for insertion is found. - Simple sorting algorithm suitable for small datasets or nearly sorted arrays. - Runtime: - Best case: O(n) when the list is already sorted. - Worst case: O(n^2) when the list is sorted in reverse order. - Efficient for small or nearly sorted lists, but inefficient for large unsorted lists. Merge Sort: - A divide-and-conquer sorting algorithm that breaks the problem into smaller subproblems and solves them recursively. - Starts by splitting the array into halves recursively until each subarray consists of single elements. - Merges pairs of subarrays by comparing elements and placing them in sorted order. - Continues merging subarrays until the full array is sorted. - Runtime: O(n log(n)) in both best and worst cases, making it efficient for large datasets. Quick Sort: - A complex sorting algorithm that follows the divide-and-conquer approach and is recursive. - Selects a pivot element, ideally close to the median, and partitions the list into two sublists: one with elements greater than the pivot and the other with elements less than the pivot. - Continues the process recursively on each sublist until the entire list is sorted. - Utilizes a pivot element that is moved to the end of the list, with pointers positioned at the leftmost and rightmost elements. - Compares the elements pointed to by the left and right pointers, swapping them if necessary, until the pointers cross. - Once the pivot is correctly positioned, the process repeats on the sublists. - Runtime: - Best case: O(n log(n)), when the pivot consistently divides the list into approximately equal halves. - Worst case: O(n^2), when the pivot selection consistently results in unbalanced partitions. Greedy Algorithm: - A problem-solving approach that makes the locally optimal choice at each stage with the hope of finding a global optimum. - May not always guarantee an optimal solution but is often simple and efficient. - Real-life example: Finding the shortest path in a weighted graph using Dijkstra's algorithm, where at each step, the algorithm selects the vertex with the smallest distance from the source.
@Leonhart_93
6 ай бұрын
Good work, works for adding to quick documentation
@ptd3v
5 ай бұрын
My man
@Lu3ck
5 ай бұрын
Not all hero’s wear capes
@TarasovFrontDev
3 ай бұрын
God bless you!
@chinmays420
2 ай бұрын
Thanks mate you saved the day ! :)
@jasonbelcher4476
3 ай бұрын
I love how you put each algorithm into a use case context. That is literally the only way my interest based nervous system works. My hat is off to you sir. Keep it up.
@Redyf
8 ай бұрын
Code examples would help a lot too, great video
@bb-xj9ed
11 ай бұрын
thank you bro, my gf broke up with me so i have nothing but to learn algos, your video made me laugh at the greedy algo part. thank you u earned a sub
@vedagyasharma5438
7 ай бұрын
stay strong brother!
@ryostyles9904
7 ай бұрын
Great choice bro
@airman122469
7 ай бұрын
Sounds like you just need some greedy algos and a creative application of the traveling salesman problem. (Routes through all bars, and pickup techniques)
@kaushalrautela6
7 ай бұрын
Broke up and still leveling up GOD mode acticated 🤖
@wadzanaikanongovere4798
7 ай бұрын
Looks like someone was greedy 😂😂😂😂
@BbB-vr9uh
8 күн бұрын
Thanks for this video! I’m starting to prepare for technical interviews now, and this is a big help!
@semilife
3 ай бұрын
Bravo, the effort shows in the quality, detail and simple concise delivery.
@hanshalili174
3 күн бұрын
Loving your channel bro! The examples you give are insightful.
@redfinance3403
4 ай бұрын
The quality of your videos is insane! Keep going, the growth of your channel is bound to happen!
@markost.8944
27 күн бұрын
Bro, these explanations are truly great and easily digestible. Hopefully there is more to come!
@largato12345
Ай бұрын
just found your channel and the videos are awesome. Amazing balance between simplicity and coverage for the topics
@wlqpqpqlqmwnhssisjw6055
2 жыл бұрын
You should explain how machine learning works and more of that types of videos too ,your explanation is on another level
@Codebagel
2 жыл бұрын
Thanks so much! I’ll definitely tackle machine learning at some point in the near future, it’s on the list of future videos!
@omgh8287
2 жыл бұрын
I enjoyed the explanations and presentation about the different important algorithms in this video. I am subscribing to this channel in the hope of similar good content in the future. Wish you the best with growing your channel :)
@Codebagel
2 жыл бұрын
Thanks so much! I’m glad you enjoyed it. Content will definitely continue to get even better, so I’m happy you’re going to stick around :)
@tamalpaul4928
7 ай бұрын
Brother, You gotta be my best teacher on youtube. You making lesson just the way I want. You start a topic by first being pause. Then continue with the easiest way possible. Please make more videos like these.
@katurr_Real_Estate
5 ай бұрын
This is the best explained algorithm I came across
@durantburner7428
2 жыл бұрын
With content like this you'll be big in no time, excited for what's to come!
@Codebagel
2 жыл бұрын
Thank you so much! I really appreciate the support!
@Obzrve
26 күн бұрын
I’m currently taking Data Structures. So this is coming very handy.
@好了-t4d
4 ай бұрын
This vid is doing quite well for explaining,appreacting your hard work.
@originallyme135
11 ай бұрын
This video is amazing! I was so surprised when I went to subscribe that you only had 5k subscribers, from the quality of these videos I expected at least 100k! Thank you for your awesome work, you really helped me a lot
@tarunpanchal1902
3 ай бұрын
Your representation helps me understand better thanks for you help
@Codebagel
3 ай бұрын
Thank you!
@bigyabajracharya5681
3 ай бұрын
Commenting for the youtube algorithm! Binge watching your videos to prepare for my technical interview. VERY helpful!!
@Codebagel
3 ай бұрын
Thanks so much! More coming soon 👀
@FaheemQazi
7 ай бұрын
Hi, i really like the graphical representation of these topics in simple manner, however i think that @10:40 the explanation of bubble sort is mentioned as insertion sort.
@LastShade
5 ай бұрын
For the traveling salesman, I would use a set of controlled variables that you could programmatically cycle through to optimize results. One example would be a tolerance on overlapping routes. Cycle through 0-10 overlaps and calculate results. Compare results. As long as you keep the number of variables and variable values low, it’s a great way to squeeze out extra optimization.
@ngocchaunguyen1195
7 ай бұрын
This is an incredible video. I didn't understand most algorithms as a student, because I focused on theories and code. This video helps me save time in understanding these popular algorithms. Indeed, I rarely use them in my work, it is simply because we don't have many situations to apply. I usually use linear search in JavaScript. there was a time I had a problem with sort of 10,000 objects. I have to use the binary-sort library without understanding. Once again, thanks for your video.
@adeyemiowolabi6062
4 ай бұрын
A very well done sir. God bless your effort & reward you. 🙏
@chrisogonas
14 күн бұрын
Well illustrated! Thanks
@dabunnisher29
Ай бұрын
This video got me liked and subscribed. You explained this really well.
@jamesf2697
Ай бұрын
I wish you would have just added an example code for each. But great video, keep up the good work!
@LeninMcDonalds
20 күн бұрын
Love it thanks for such a clear explanation with examples . Liked and subbed
@antonthordarson3610
6 ай бұрын
This is great, Very well explained and straight to the point. Way better than any teacher I have seen explain this..
@hassanriaz4274
5 ай бұрын
Thank you so much for this detailed video bro👊👊
@coffeewithgoutam
5 ай бұрын
Explaining Data Structures with Code Examples would be more beneficial. This video is informative too.
@DavoMelendez
Ай бұрын
great video... straightforward explanations
@i_am_spex6312
9 ай бұрын
Dude , you explain so well. Thank you
@lenicholstech
3 ай бұрын
Excellent explanation!
@therealzeon
2 жыл бұрын
I know ur working hard my guy but keep pushing you'll breeze to 100 k by the end of the year dw 💪🧠 Keep up the amazing content man
@Codebagel
2 жыл бұрын
Thanks so much! Been such a grind lately with everything going on, but definitely going to start pumping out more videos so that’s good :)
@simonetumolillo9400
2 жыл бұрын
I love the fact that you took the time for writing the outcome numbers of TSP in the comments haha. Nice work as always, keep it up!
@Codebagel
2 жыл бұрын
Haha yeah, to me that’s such a strong way to explain why certain algorithms are used. I’m glad you enjoyed!
@yuqingpeng6523
2 жыл бұрын
Very detailed explanation as always! I learnt a lot, thank you so much!!
@Codebagel
2 жыл бұрын
You’re welcome! Thanks for the kind words :)
@mitkomilev4690
7 ай бұрын
Good explanation, thank you. A small note for the quicksort - keep in mind that the unshift operation at 13:44 is really computational costly as you will have to unshift all elements to the left. It is better to just swap the chosen pivot element with the last one.
@voegel
2 жыл бұрын
Thank you for this comprehensive video! 21 minutes is a good length. Btw, did your job interviews went well?
@voegel
2 жыл бұрын
Oh and here is some advice that I think might be helpful: I know music in videos is vastly used, but mostly it‘s a bit too much. The music in this video was okay, but I actually liked the music-free videos more. They *seem* to me better structured/clean. I know this video has the same great content as always, but (maybe it‘s just me) I have problems following you. Idk, maybe I‘m wrong and using music is a good idea ^^ Just a friendly tip :)
@Codebagel
2 жыл бұрын
@@voegel thank you for the feedback! I’ve been experimenting a bit with the music, but I get that it might be a bit hard to follow with it. I’m going to experiment a bit with audio levels/not including it at all, thanks for letting me know :)
@TarasovFrontDev
2 ай бұрын
Omg, that’s so cool! Outstanding work!
@lintruly6269
4 ай бұрын
I start learning data science because the curiosity. I used to learn math and data structure before but I don’t know where to apply so now is different I can know.
@arthurmorgan718
2 жыл бұрын
Your content is literally quality over quantity , keep the good work man
@Codebagel
2 жыл бұрын
Thank you! I really appreciate it :)
@Antariksha
2 жыл бұрын
Please keep going, your explanations are on point! Subscribed.
@Codebagel
2 жыл бұрын
Thanks so much!
@ektasingh5967
5 ай бұрын
I love all of your videos. Amazing they are. Please make videos on System Design as well.
@NormieDead
6 ай бұрын
thank you soo much. i know this could have taken so much affrords to make .
@2gelKifissias
8 ай бұрын
I really wonder how this video hasn't blown up after a whole year
@MadhuKumar-zi4qp
7 ай бұрын
easy to understand bro.. great. Thanks!
@thaisb.7708
6 ай бұрын
Amazing content, very clearly explained and the illustrations helped a lot, thank you for sharing.
@shubhsharma19
Ай бұрын
Underrated channel Subbed!!
@voegel
2 жыл бұрын
Hey, I‘m wondering if you are still planning to make a video about how to pass the resume screening? That might be quite interesting :)
@Codebagel
2 жыл бұрын
Yes, it’s actually the next video coming out! I’m hoping to get it finished and uploaded for Monday! :)
@Codebagel
2 жыл бұрын
Okay so I didn’t finish it in time for Monday haha, had 2 last minute interviews come up. It will be out by tomorrow though, guaranteed!
@mohammedswiti3842
3 ай бұрын
Amazing!! You helped me so much!!
@hemakumargantepallidataandai
4 ай бұрын
Like your voice, subcribed to listen it as frequently as possible.
no hay un video que te enseñe todo, al final debemos consumir mucho contenido de calidad e intentar quedarnos con lo positivo de dicho contenido para internalizarlo y realmente poder implementarlo de manera adecuada. Este video a mi criterio cumple con el criterio de ser un video de calidad.... No comenté en inglés porque siento que los hispano hablantes que no son angloparlantes merecen también hacerse notar en las cuentas de tecnología donde usualmente solamente se habla inglés
@mesta3329
7 ай бұрын
Great job bro. It was very interesting & easy to understant
@seannaeger9563
7 ай бұрын
I've been trying to understand these concepts for ages. Your videos rock! Even if you spell neighbor wrong. 🙂
@muhannadalsabbagh8956
Жыл бұрын
Really appreciate your work but you are wrong about the insertion sort algorithm you explained the bubble sort insertion sort will compare each number with the previous numbers and put it in place. Hope you will fix the video
@panthrax555
7 ай бұрын
I came here to say this. I've not heard of insertion sort before, this is definitely a Bubble sort.
@sujeet4410
2 жыл бұрын
I was here before this channel exploded. Keep the contents coming.
@Codebagel
2 жыл бұрын
Thanks so much Sujeet! I’ll keep working towards making better and better content for you to enjoy!
@khndokar2382
9 ай бұрын
Love your videos ! please do more, ive learned so much
@hlubradio2318
5 ай бұрын
Thanks I'll subscribe for your hard work. Now to implement them in Python.
@a.rohimsama7222
6 ай бұрын
Great explanation! Thank you
@khndokar2382
9 ай бұрын
can you please upload the separate data structure videos? i really liked the hashmap one
@YoYouWildinBro
2 жыл бұрын
When I get my coding gig in the future, I'm gonna look back at these videos and think "This is why I landed this job".
@Codebagel
2 жыл бұрын
Wow, you have no idea how awesome that is to hear. Thank you so much for that, and I hope I can continue to keep helping you on your journey towards breaking into the tech industry!
@Rei-m3g
2 жыл бұрын
I learnt one and it never feels enough . 😅🥲
@user-do8mv9ow6d
Ай бұрын
This video is very helpful ❤
@pptmtz
4 ай бұрын
Thanks, great explanation
@FaberLSH
2 ай бұрын
Thank you so much!
@abyss_v
7 ай бұрын
Great video, helped me a lot
@franciagarciaromero2589
6 ай бұрын
Loved this, please make more videos
@ann.z.z.
6 ай бұрын
Thank you so much, amazing content
@ShengjunSun-on1jr
5 ай бұрын
Great contents! Thank you!
@hlubradio2318
5 ай бұрын
This so weird. I leaned all these in 1994 to 1997 but never heard of greedy or maybe I did but I certainly remembered the shortest path algorithm which is greedy
@ankiitamalik
7 ай бұрын
Thanks🙏 very clear explanation
@MeditateRelaxEtcetera
6 ай бұрын
Great explanation!👍
@vasylshkrum8007
7 ай бұрын
Great job, mate!
@Amuzeraa
5 ай бұрын
Thank you very much for providing time to teach us the internet strangers
@egsnowindy
6 ай бұрын
Thanks for the video. Note: Merge sort is not properly explained. 1. it requires creation of temporary arrays of size equal to the sorted array. 2. the "merging" process itself is not highlighted in video.
@K9Megahertz
7 ай бұрын
You don't really need to keep track of the visited nodes in a DFS. You just visit the left node first and then the right node, or in the case of a tree with n children per node, just visit them in sequential order. At least if you're doing it recursively. Maybe there's a reason to keep track of the nodes outside of the recursion for other purposes but not for the actual traversal.
@kayfintedch
6 ай бұрын
Man, this just helped me so much in ways I can't even explain. Took the entire time taking notes and all. Really appreciate the hard work that was put into this, like and sub from me cheers!
@bonginscandinavia
6 ай бұрын
Great explaination. 👍
@llmll6447
6 ай бұрын
Very good explanation
@catarinaivf
11 ай бұрын
It was really great! Thanks
@sreyakarmakar4248
7 ай бұрын
Dynamic Programming left the chat..🏃🏻♂️🏃🏻♂️ PS: amazing visuals & explanations. Thanks ❤
@oulaoula349
6 ай бұрын
Travelling salesman problem is à good support to practise genetic algorithms
@YamiHoward
17 күн бұрын
Greedy sort is not used when you need an ACCURATE answer, not efficient as you initially stated. The CC has it correct later on. Important difference though, as greedy sort is way more efficient when you're looking at impossibly large possibilities!
@Sachin-je7ue
7 ай бұрын
Well explained but you mentioned binary search only works for sorted list but it is not true .It also works for unsorted.
@aaryankedia3919
Жыл бұрын
Hey, Thanks for the video. I am a final year CSE student and I have the placement season starting soon. I am left with a lot of DSA. Could you suggest me with some tips?
@chamarr
2 жыл бұрын
can you possible make a video on how to code up these algorithms? that is what i have the most trouble with
@Codebagel
2 жыл бұрын
Yes! That’s what’s coming out next! I’ll be doing kind of 8-10 minute in-depth videos explaining how the code works, and how to solve problems of using the algorithm! Stay tuned :)
@chamarr
2 жыл бұрын
@@Codebagel yessir goated youtuber🐐
@MohitKhare
23 күн бұрын
Thanks a ton...❤
@rondlh20
5 ай бұрын
11:48 How does this sorting work in detail?
@TrishalWalia
5 ай бұрын
Best Explanation!
@badmadmat20
2 ай бұрын
Pseudo code would be very helpful.
@ZyrusAlvez
9 ай бұрын
I rly wonder how those algorithms would help me to be better in solving coding problems
@ArunkumarGurram-p5x
7 ай бұрын
Good work bro keep on doing 👍
@rutwikpatil8491
5 ай бұрын
Amazing video !!!
@puneetparashar2935
5 ай бұрын
Love your videos.❤
@ranvirkumar108
Жыл бұрын
Great work men...
@beeTechSE
6 ай бұрын
Wait for Dynamic programming video 😁🤘
@MarkyGoldstein
8 ай бұрын
Software engineers should first focus on real world problems, such as progressing standardizations and protocols, de-powerize monopolys, and then of course optimize
Пікірлер: 204