3 Types of Algorithms Every Programmer Needs to Know

[@mossabDiae]

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]

same

[@goodshorts]

Agreed

[@lukashuth9730]

Really nice and informative video while still being short without "unnecessary" information, i really liked it

[@yourma7055]

True

[@friscotycoon]

my teacher gets paid 200k and he told me to refer to my knowledge from last semester. I find this guy free on KZbin, college is wild. Thank you sir

[@DC4477north]

Video starts at 0:01

[@Itisghost]

yeah no shit sherlock

[@zidanalwy]

thank you for warning me

[@User.Joshua]

You certainly have a knack for explaining things in an easily digestible way. Thanks.

[@softcolly8753]

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]

exactly

[@lukaszantoniak9046]

agree

[@drakkor1000]

amen

[@cbc700]

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]

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. 🙂

[@OGNord]

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]

Finally someone who is happy with C and doesn't cry 😃 Thank you for showing hope 🙏

[@zoeherriot]

@@thobiaslarsen8336 C rocks. Great language.

[@kaneryu]

idk why this comment made me so happy you go man! (or girl, lol)

[@thobiaslarsen8336]

Probably because there is a lot of negativity in the field right now, so its very refreshing to see something actually positive 😂

[@youMatterItDoesGetBetter]

C is cool.

[@JustDevInc]

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!

[@wolfmansaw]

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!!!👍

[@Kamuisakeu]

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!

[@rilauats]

Graphs were my favorite back at university - and still are as I graduated in operations research. That informed most of my software design decisions across 40 years career so far. Back in late 1980s, I wrote compiler constructing the entire app as a graph - then optimized the graph before generating the "optimized code". You earned yourself another subscriber!

[@jynx0riZ0r]

Best explanation of dynamic programming ever. Thank you. ;-)

[@wille4986]

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!

[@BillyLongshot]

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

[@Ascendance1992]

I really appreciate the reminder that this is the stuff that takes you from dreaming about it to actually practicing getting there-- turns out I'm on the right path; these algorithms are exactly what I've been practicing.

[@nitheeshraajar393]

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 👍

[@jonarielm]

nlogn if data is unsorted i guess.

[@nitheeshraajar393]

​@@jonarielm then yup nlogn to sort then logn to search

[@lagmaker]

​@@jonarielm you cant use binary search on unsorted array

[@deraxelturrelkeign]

@@jonarielm 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]

He even said "for sorted arrays"

[@cedrickmccallon]

Almost 20 years into the game and I wish my CS teachers would have explained these algorithms this well. Great video.

[@aggumbi]

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! ❤

[@ademromdhane1271]

Amazing how easy you can simplify this hard algorithms visually , good job i really like it

[@o0Revlimit0o]

straight to the point! One of the best Software/Web Dev channels out there!

[@CauseItsNotMidnight]

More of this. Visual representation is stimulating, explanation is clear, analogies could be slightly more engaging, but are effective as is.

[@TampaCEO]

Outstanding video. I've been a professional developer for over 30 years and I have to say that this video is by far the best I've come across on KZbin. Here's why: 1. Outstanding graphics. That cannot be understated. 2. Outstanding explanations. 3. You get right to the point (no wasted conversation). Consider me a new subscriber (to add to your half million or so). Congratulations on the success of your channel.

[@gregoryhost5188]

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.

[@hunterlewis5566]

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!

[@max_masterius]

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.

[@ringringlord]

very straight to the point and zero clutter

[@BetweenTheBorders]

I'll be honest, I almost didn't click on this video, bur I thought "you know, as a dangerous amateur, I should see what I should know." And I guess since I've implemented A* before, I'm not too far off the mark. Good to have some sort and search concepts in the toolbox for future research. Well presented!

[@TubeAccount-b1f]

Channel is gold, also just discovered it.. look my dev stint is sitting around 24 years 'ish.. I've never had to implement these algo's in the banking industry, however such a pleasure listening, learning and seeing true passion at play. Well done, subscribed and will keep popping in every now and again.

[@krzysztofs3t532]

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!

[@Dwafford01]

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.

[@guitarman813]

One of the best videos I've seen for an introduction and basic explanation of important algorithms in computer science and programming. Awesome job! 👏

[@ongeziwejunior4656]

man, you explain these very well. still a newbie in DSA and trying to get my way around them and so far, from you i'm understanding them a bit better💯. I'd actually love to hear more from you.

[@techfixer1543]

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!

[@daemon_zero]

Straight to the point, great graphics do illustrate, and as a bonus, no trademark "tech influencer" neon on background. Subscribed, absolutely.

[@rogueronin1010]

Make a new playlist for all algorithms in depth videos. Thanks for the bite size explanation.

[@wyohman00]

I wish every creator on KZbin would watch your videos! To the point with no baloney. Thanks!

[@chrisc9725]

Your a top man. Thank you. Hope you are blessed abundantly for all your efforts 🙏🏼

[@JasonWelch]

I love this video because it introduces people in a rather gentle way to these topics. I feel like I could write an entire book on my experience as a programmer at this point (not that I think anyone would care to read it). I've been coding for over 25 years since I was a teenager and got my first dev job at 20. Back then I was super arrogant until I began working with people far more skilled and experienced than me, and so I studied CS for several years. However, I think the problem back then wasn't so much a lack of willingness, but simply a lack of awareness. I didn't know what I didn't know. I remember struggling to understand BSP trees, and then it became obvious to me later why: I didn't even know about binary search! Videos such as this one are immensely valuable for those early on in their programming journey.

[@cryptonative]

I like to categorize algorithms with inserting (eg. btree, BST), searching (eg. binary search, dijkstra), editing (eg. bubble sort or merge sort) and deleting (similar to inserting) That's all you can do with data

[@zakuguriin4521]

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.

[@Andron4iKTV]

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]

Good catch! Thanks for pointing that out.

[@TT-hi7lp]

Was just about to comment about this

[@alexrubio9507]

​@@TT-hi7lphahaha same here

[@OGMann]

Oh yep. Everyone was.

[@slayergaming5421]

Great video! I really like the visual depiction of Dijkstra's and A*.

[@markpalma1761]

showing which part of the code the is being ran live with the animation makes learning this much easier

[@edattacks]

I like the visual for A* algorithm being how lightning connects to an upward streamer

[@MrHaggyy]

A* visulisations are so fun to watch. Always reminds me how lightning in a slow motion searches for the path of least resistance through air while burning also burning left and right through it.

[@Radio_N_Casa]

Truly enjoyed this, simple enough and yet leaves me wanting more. Well done

[@sayo9394]

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!

[@letsfly662]

Break down the algorithms and data structures you think are necessary bro, these things are timeless!

[@GideonBryceTan-od4tq]

Well explained and condensed -- it's like crash course for algorithms. Great stuff!

[@InconspicuousChap]

Ιllustration of the algorithms in a language for non-programmers is quite symbolic. The target audience don't even realize how far is such a keyword-based memorizing of popular concepts from actual learning and understanding stuff.

[@bardson]

okay, I absolutely loved this and need more of this.

[@ziacodes]

Hey hey, Your talking style is amazing! The way you explained the algorithms is fabulous! I love it!

[@joaquinpickelny8958]

I really hope you are making money off these videos (this is the first one I've seen), because every single cent would be well deserved. From the content itself to the visual examples and code, not to mention how easily you explain these concepts in a complete yet straightforward way. It took me maybe 13 seconds to subscribe.

[@aaronmorgan4466]

Really great explanations, thank you. This highlights where I came unstuck in AoC '23 quite well :)

[@SOURCECODE_GAMEON]

Landed here and subscrided in the first 15 seconds. Why? You went straight to the point. Thank you.

[@dougpark1025]

The O(n) postman or bucket sort deserves a mention. Very useful when you have a limited number of integral values (like zip codes). I have used this in a few cases where I was dealing with a very large number of items that could be placed into buckets or ranges. Another good improvement to sorting is to take advantage of multiple cores. A lot of sorting algorithms are fairly easily decomposed into parallel operations.

[@escapist818]

Oh man I would love a deep dive video on hashing algorithms, your stuff is great!

[@alexaneals8194]

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.

[@alialibaba6672]

Hey Forest, great wor and marvelous graphical representation. Please continue

[@flpflpflp]

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!

[@omargoodman2999]

What about the "really bad" sorting algorithms? Like "Stalin Sort": Step through the list one item at a time and, if the item is out of order, delete it. This results in a sorted list at the end [may result in some lost data]. Or "Miracle Sort": Step through the list and check if the items are in sorted order. If they are, return the list of sorted items. If not, wait a designated amount of time, recur function to see if the list has miraculously become sorted. Continue recursion until a sorted list is found.

[@farquisimo]

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

[@KenyanNetHunter]

Thank you Forest, you've explained these concepts really well.

[@chrisnortonjr]

Yes, make more videos like this. I’m currently learning DSA

[@matias-dev]

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!

[@twisthard]

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!

[@dereklewis546]

HEY, I LEARN C IN 1980'S ( THE DR - KR EDTITION ) I WAS DOING THAT SORTING AND ALGORITHMS, IM SO HAPPY YOU HAVE THIS VIDEO, MAKES IT MUST EASY TO GRASP, ( TO ME IS Ai & ML )

[@grassifuentes]

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!🙏🏽

[@WebSurvival]

That's gold content. Helping me alot on studies here 🤯

[@forsmanos]

Very nice graphics for your examples. Nice enough, i almost felt like i was watching an ad.

[@ericajcruz]

Great video. More "boring" algorithm videos please! Thank you for posting this.

[@davidrichman2117]

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!

[@adnelfigueroa1227]

Awesome video! Loved your explanation and the fact that you incorporate funny comments. Exited to see more.

[@the-nomad-show]

Thank you for the lesson! Really great! Made me realize I'll have to write my own implementation of A*, not just use someone else's. I sort of understand it already, when I look at the code. But I immediately forget how it works when I stop looking at it. And that's not quite good enough :-)

[@CTLanni]

I always liked the Heap Sort. I thought it was brilliant and plenty fast for me. It served me well for about 40 years. I also liked the binary search.

[@stevemacmanu]

I don't agree with you saying these videos don't make you dream about being a software engineer They're making me dream and that's why I just subscribed Please make more videos like this, I love them and they also shape your thinking as a computer scientist Thank you very much

[@vishnum4852]

Great videos. Liking this nitty gritty concepts which are not popular in yt We need more videos like this man..

[@alexrubio9507]

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!

[@TheDanielvenom]

I always think that I have one kind of sort. This video literally blows my mind. Good vid.

[@incognitiveincognito]

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

[@aimansyahmi6571]

Please do more of these types of video!!

[@natalkaskus6547]

wtf ur explanation is unbelievable, so on point

[@manuelgonzales6483]

Hope you're doing well. Thanks for sharing your knowledge and understanding of programming 🎉❤

[@SN-ed7wi]

Excellent vid for all the reasons stated by others, well done. Too bad there are some who think the info is not practical today. The fundamentals you learn by coding even one of the efficient sorting algorithms will stay with you forever.

[@christianmboula8923]

Superb content, excellent delivery! where were you when I was taking DS a few decades ago!

[@preludeofme]

Keep these types coming (but also don't stop the long form too 😊)

[@YeshuaIsTheTruth]

Its nice to see a video about programming that isnt just some 22 year old playing trap music and telling me i can earn 75,000,000 an hour while drinking a latte.

[@DoNsMaK190]

thanks for all those efforts that made to make those graphic explanation

[@jeffreyphipps1507]

I think this is essential for a more important reason. A programmer may never use any of these directly, but the knowledge that these mechanics imprint can be used in other places. I had an instructor once who wanted students to make a faster sort. Spending the time to do that wasn't worth it - I already knew seven sort methods. I dropped the course and told him why. I later retook the course with another instructor. What I didn't learn the first time was that I could use methodologies from three sorts to leverage different data structures that I had never seen before. You may never know that until an instructor tells you that. The first one didn't, the second one did. The difference was that the first instructor was also a math instructor and taught theory. The second was also a systems analyst instructor used to teaching OS design. His POV was different. I learned something else from that experience - I later became an instructor, and I had learned that not everybody's background/experience is the same. When answering a question, it's a good idea to know what the student's experiences are.

[@surferbum618]

Thank you for making this. Yes please, more of these!

[@techsalesandmore3649]

never seen your channel before. Totally loving your animations!!!

[@skilz8098]

When working with 3D Graphics and a Scene Graph Hierarchy for world object placements and collision detection systems, one of the more generalized and efficient data structures - algorithms is the BSP Trees and its variants. Binary Space Partitioning Trees are very powerful. Related to them are also the Quadtrees and Octrees. Another type of algorithm not mentioned here which is a bit different than your conventional sorting or searching algorithms is your transformation algorithms. I'm not necessarily referring to transformations as physical translations within basic kinematic physics such as horizontal - vertical translations, rotations, and scaling perse but more on the lines of transforming data or input singles from one domain to another. One of my favorite algorithms especially with in analysis is the Fast Fourier Transform and its inverse. A few other noteworthy algorithms are ODEs (Ordinary Differential Equation solvers), Integrators, regressions models (linear, quadratic, cubic, etc.) and Interpolations. Other than that, this is great video for everything you covered is right on point! We always have to consider both the time and space complexities of various algorithms, containers, and datasets knowing the various tradeoffs between them. The only other thing that would be missing from this video is how different containers and algorithms are affected by locality especially when considering cache coherency and perhaps branch predicting, page boundaries and alignment as they can very well affect the performance and efficiency of various algorithms.

[@cristianionascu]

Looking forward to the follow-up Forest!

[@EagleHunt]

Make more videos like this. Informative content is what I’m here for

[@theodorewyatt3473]

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.

[@pedroacosta6850]

You explained it in simple terms and it made it easier to have a better understanding of how these different algorithms work. Subscribe. Like. Great visual demonstrations as well.

[@alivaliev5152]

Right when I needed it most, this gold! Keep on this!

[@indecisive.m]

This is genuinely so confusing for me but also incredibly interesting

[@fackyoutube8452]

It’s not take a course on it, it’s not as hard as you think. If you ignore the coding part and make it intuitive it will start making sense. Then think about what each line of code does and how if you remove that line of code, what specifically happens that causes the error. If you can’t explain a concept inside and out like that, then you truly didn’t understand it yet.

[@Viafro612]

As a developer, i always suscribe to a better devs channel. Well done

[@litpath3633]

that a* visual was awesome, looked like lightening