3 Types of Algorithms Every Programmer Needs to Know
It's my thought that every programmer should know these 3 types of algorithms. We actually go over 9 algorithms, what they are, how they work, real-world use cases, complete with code examples and explanations, but they fall under 3 categories, 3 types of algorithms you should know.
Sorting Algorithms - used to rearrange elements in a list or an array in a certain order. We discuss bubble sort, insertion sort, and merge sort.
Searching Algorithms - used to find or retrieve an element from a data structure, or to determine its existence and location in the dataset. We discuss linear search and binary search.
Graph Algorithms - used to solve problems related to graph theory, where data is represented as a collection of nodes (or vertices) connected by edges. You probably know these as trees. We discuss depth-first search (dfs), breadth-first search (bfs), Dijkstra's algorithm, and A* algorithm.
So, why are these algorithms you should you know? Because they form the foundation of efficient problem-solving in computer science. Their study not only enhances programming skills but also deepens analytical thinking. And they’re instrumental in optimizing software performance across a wide range of real-world applications. I hope you enjoy the video and learn a thing or two!
If you're a developer, sign up to my free newsletter Dev Notes 👉 www.devnotesdaily.com/
If you're a student, checkout my Notion template Studious: notionstudent.com
Resources🔎
visualgo.net/en
www.toptal.com/developers/sor...
motioncanvas.io/
0:00 Why algorithms are important
1:35 Sorting Algorithms
5:44 Searching Algorithms
8:06 Graph Algorithms
12:29 Want more algorithm videos?
------------------------
🖥️ Dev Notes Newsletter: www.devnotesdaily.com/
📓 Studious, Notion Template for Students: notionstudent.com
Don't know why you'd want to follow me on other socials. I don't even post. But here you go.
🐱🚀 GitHub: github.com/forrestknight
🐦 Twitter: / forrestpknight
💼 LinkedIn: / forrestpknight
📸 Instagram: / forrestpknight
Пікірлер: 564
The only time I have needed to implement a sort algorithm in 21 years as a software developer was for interviews or university exams. Never needed a graph algorithm at all. These are all coded into libraries these days, though it's somewhat useful to understand them, understanding how to index a database properly (applying them) is far more useful.
@gustavofagundes8994
3 ай бұрын
exactly
@lukaszantoniak9046
3 ай бұрын
agree
@drakkor1000
3 ай бұрын
amen
@cbc700
3 ай бұрын
This was quite a nice video, especially the visuals. However, I agree with the sentiments of this thread. In three decades of coding, I've only had to implement a sort algorithm a handful of times. So rare in fact, I can't remember the last. Interesting to understand, but softcolly is right -- mostly seen in school and interviews. Your delivery is quite good -- going to check out your other vids.
@joannehart9624
3 ай бұрын
Back in the late 70s when I started coding, we often needed to implement sorting algorithms into our code. Sometimes because the operating system did not have a system sort, and other times because the overhead of setting up the code to use the system sort made it easier to just code a sort into the program. Back then CPU and memory were at a premium, so we had rules such as if the program needed to search through a table of more than 100 entries, the program had to sort the table then preform a binary search. Fun times to look back on. That said, those approaches have stuck with me throughout my career and oft times helped me fix resource heavy applications that wouldn't finish within the time frame demanded by business. 🙂
The first video I watch on your channel, subscribed in 24 seconds because you started sharing value quickly without a long unnecessary intro.
@rodoxsta
Ай бұрын
Same here, but I subscribed after reading your comment!
@FernandoSLima
12 күн бұрын
same
Really nice and informative video while still being short without "unnecessary" information, i really liked it
@yourma7055
3 ай бұрын
True
This was very nicely done. The visuals and your commentary allowed me to understand the algorithms in ways that previous videos I’ve watched haven’t. They’d either be too basic of an overview to get what’s happening, or too code based without visual cues to help you understand. This was a perfect balance of simplicity and depth. Great work!
Your enthusiasm is infectious and reassuring - knowing someone else finds this all just as fascinating to dive into but presented with the quality as you do is a privilege to watch. Excellent video and I can't wait to see more! Thank you!
You certainly have a knack for explaining things in an easily digestible way. Thanks.
The quick and concise video with visual representation together with the code sample was right on the spot! Cheers to that and give us more!
Wonderful video. As a scientist going through a programming journey, the way you show the visual and explain the code (with the highlights, etc...) is extremely helpful. More algorithm videos please! ❤
love the intro and general framing of this video: no glam dreams about becoming a software engineer but the actual nitty-gritty that actually makes you one
Dude this was gold. I’m currently on week 3 of CS50s course and I’m in love with C and programming so far. This is a very succinct explanation of each section! Thank you very much
@thobiaslarsen8336
3 ай бұрын
Finally someone who is happy with C and doesn't cry 😃 Thank you for showing hope 🙏
@zoeherriot
3 ай бұрын
@@thobiaslarsen8336 C rocks. Great language.
@KaneryU
3 ай бұрын
idk why this comment made me so happy you go man! (or girl, lol)
@thobiaslarsen8336
3 ай бұрын
Probably because there is a lot of negativity in the field right now, so its very refreshing to see something actually positive 😂
@youMatterItDoesGetBetter
3 ай бұрын
C is cool.
Well explained and condensed -- it's like crash course for algorithms. Great stuff!
One of the best videos I've seen for an introduction and basic explanation of important algorithms in computer science and programming. Awesome job! 👏
Truly enjoyed this, simple enough and yet leaves me wanting more. Well done
Loved the video, straight to the point with the necessary information, i had this kind of algorithms shown to me in programming classes in college and i always dread how they were shown, sometimes people overcomplicate the initial step of a bigger problem (probably not in a badly intentioned manner), i think your video is a great way to get started on these topics!
Amazing how easy you can simplify this hard algorithms visually , good job i really like it
I've been coding for 55+ years and I'm so glad I found you today! Great stuff!!! Right into the code and no fluff! I think you define what it means to be a programmer!!!👍
This was really amazing and great timing, I'm currently struggling with algorithms especially trying to figure out where and how exactly to use them.
Just want to let you know @7:35, you say Binary search is O(log n) but on the chart its pointing to O(n Log n). Very nice video 👍
@jonarielmaravilla1503
3 ай бұрын
nlogn if data is unsorted i guess.
@nitheeshraajar393
3 ай бұрын
@@jonarielmaravilla1503 then yup nlogn to sort then logn to search
@lagmaker
3 ай бұрын
@@jonarielmaravilla1503 you cant use binary search on unsorted array
@deraxelturrelkeign
3 ай бұрын
@@jonarielmaravilla1503 Binary search couldn't function (effectively) on unsorted data without sorting first. An unmodified Binary search will either find what its looking for in O(log(n)) like a normal binary search (the algorithm just happens to go the right direction), potentially falsely return -1 or I believe get stuck in an infinite loop.
@murilourso
3 ай бұрын
He even said "for sorted arrays"
This is excellent. I took algorithm designs a year ago and this refreshed my memory by a lot and made me want to look into it for practicing again. Thank you!🙏🏽
Thank you for making this. Yes please, more of these!
Thank you! Your lucid explanations of these algos shows your in depth knowledge, and the accompanying graphs are fantastic and hit a home run in visually expressing the underlying concepts. And you keep the viewer engaged with your peppering of being flawlessly snarky. I had to rewatch the part on the Dijkstra's algorithm to let it sink into my ever evolving brain in "thinking and reasoning" mode. Fantisic vid overall!
You made a mistake when show to us time complexity of binary search. You put finger emoji on O(n log n) insead of O (log n).
@fknight
3 ай бұрын
Good catch! Thanks for pointing that out.
@TT-hi7lp
3 ай бұрын
Was just about to comment about this
@alexrubio9507
3 ай бұрын
@@TT-hi7lphahaha same here
@OGMann
3 ай бұрын
Oh yep. Everyone was.
Hey man, I've been a subscriber for a few years now. I think this is the content I liked the most. Keep up the great work!
I'm fairly new to computer science and programming and I love this and would love to see more of this, you got my support and vote of confidence!
Awesome video, the quality and breakdown was great. Definitely going to be checking out more of your content :)
Best explanation of dynamic programming ever. Thank you. ;-)
Hey Forest, great wor and marvelous graphical representation. Please continue
I loved this video, I just want to say I finished my BSc it with programming specialisation in the end of 2020. Now for the first time I'm being treated as a developer by the company I'm working for. It's both exciting and nervous, but with videos like these I think I will be okay.
very straight to the point and zero clutter
Make a new playlist for all algorithms in depth videos. Thanks for the bite size explanation.
It's so visual! I've got the motivation to look deeper. It's a long time after my university that I actually touched this topic.
Awesome video! Loved your explanation and the fact that you incorporate funny comments. Exited to see more.
Great video! I really like the visual depiction of Dijkstra's and A*.
Right when I needed it most, this gold! Keep on this!
Great vid, would love to see more on algorithms!
Hey hey, Your talking style is amazing! The way you explained the algorithms is fabulous! I love it!
Thank you, Forrest Knight! Just review for me, but I wanted to say that you have a wonderful down to earth way of presenting that I really appreciated. Keep up the good work!
never seen your channel before. Totally loving your animations!!!
Oh man I would love a deep dive video on hashing algorithms, your stuff is great!
Straight to the point! Great video!
thanks for all those efforts that made to make those graphic explanation
Love this vid. nice guide on common and frequently used algorithms, definitely going to sub to your newsletter, thanks!
Nicely done and presented! A couple of these were not presented in my CS Data Structures and Algorithms course, and as such this was a great view into those. One algorithm I never really got the hang of was hash tables. Now you have me thinking about that again. Well done!
Almost 20 years into the game and I wish my CS teachers would have explained these algorithms this well. Great video.
I would love more of this, it's very interesting and informative
Thank you for this content. I really enjoyed it. pls keep putting out more!
Would love to see more stuff like that! Definitely subbing
Man I wanna say that you're so talented at making these videos. It is so clear that you love doing them. Please keep posting, you re a rockstar!
Wow man! I'm a mathematics major, working as a React developer and this video rekindled my pursuit for pure programing, not just learning another library! Thank you very much! Immediately sub!
Great video, nice summaries. Thanks!
Really great explanations, thank you. This highlights where I came unstuck in AoC '23 quite well :)
I built an array sorting algorithm visualizer with some classmates in programming school for our Javascript Team project. Watching it sort huge arrays was so addicting and mesmerizing.
Hey Forrest, first video of yours I have watched. Great presentation style.
Superb content, excellent delivery! where were you when I was taking DS a few decades ago!
Forest, just discovered your channel. Love your content and style.
Loved this video. More please. Passion and well explained 😁
This is really good bro, thank you
Really good video, it’s a great summery of what I learned in collage. Will definitely rewatch this sometime in the future 👍
Great video. More "boring" algorithm videos please! Thank you for posting this.
Great videos. Liking this nitty gritty concepts which are not popular in yt We need more videos like this man..
I always think that I have one kind of sort. This video literally blows my mind. Good vid.
showing which part of the code the is being ran live with the animation makes learning this much easier
You're explanation was better than anything I've ever heard! I love how you used Dynamic algorithm to explain the content 😜. First sub I've done in a while for this kind of content. Heading over to look at the rest of your stuff now. Thanks for your time and effort.
Whatever video editing software you are using is really cool. i loved watching the code being stepped trhough and then visually seeing what was occuring above it.
Going to study up on these, thanks!
This was so well done!
I enjoyed your presentation. I will say that many times insertion sort is used by quick sort once the array is partitioned into small portions like < 10 elements. Also, these are in memory sorts, so if your accessing the disks frequently then you may not want to use these algorithms. Same goes for binary search. I don’t know if you have already covered it, but knowing how to code parsers can be valuable. I have lost count of how many parsers, I have had to code in my professional career.
Please do more of these types of video!!
Thanks Frank. Great content 👌
Nice video! The hashing idea sounds interesting! 😊
Forrest, your videos are damn near perfect. I've watched 5 in a row and subscribed to your channel and the newsletter. Probably gonna pull the trigger on the notion studious next.
@fknight
Ай бұрын
I appreciate that! Hearing this really means a lot
Man this is a pretty good video! keep up the good work.👍
Amazing. Keep up the good work!
Make more videos like this. Informative content is what I’m here for
I wish every creator on KZread would watch your videos! To the point with no baloney. Thanks!
Hope you're doing well. Thanks for sharing your knowledge and understanding of programming 🎉❤
Thanksnfor sharing. This is a great help by visualizing the algorithms. Subscribed
nice video! Would love more in depth and longer videos
Really interesting!! More of this.
What a genius content! I love to subscribe to the channel ❤❤
Great explanation, thank you. Subscribed
You are an amazing teacher!
Wish you where my data structures proffesor, then I might not of had to retake the class so many times haha. Amazing video, can't wait to see your other stuff
Love your enthusiasm
Ah, this was so good! Thank you!!
Great video! Love that you covered the gamut, yet KISS!
Keep these types coming (but also don't stop the long form too 😊)
really nice video and a very good presentation. please consider making more videos as such
Fantastic video. Subscribed!
Great explanation!
I definitely like to see more algorithm videos you do them very well and explain things in similar terms. These things should help others as they go along their coding challenges when it comes to algorithms. I would says you should incorporate how code design patterns come into to play too.
Dude this is cool we need more!!
Please more algorithm videos! I liked and subscribed!!
I don't comment often...this was awesome Forrest! Keep 'em comin'!
Really great video. It would be interesting to see a video on the Knapsack algorithm, and the boarder linear programming and optimization algorithms.
Amazing video! I can’t wait until I can develop this type of understanding of the different algorithms! Thank you for sharing this! 🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥👏👏👏👏
Great primer/intro
Subbed, great explanations, Thank you.
it's fun watching your videos as a senior engineer who just uses STL's std::sort too much without putting much thought into its algorithm! i tend to think more about data structures rather than algorithms!
thanks man, more of this