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.
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.
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. 🙂
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
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!
@@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.
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!
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!!!👍
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
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!
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! ❤
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.
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.
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.
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!
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 UA-cam. 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.
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.
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!
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.
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.
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
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.
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!
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.
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.
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!
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!
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.
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.
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.
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!🙏🏽
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 )
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.
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!
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!
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.
A mere 32 seconds in, a good start, a tree is a subclass of graph, i.e. every tree is a graph but not every graph is a tree -- saying the we know graphs as trees is a _bit_ wrong (see: Graph Theory)
Ι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.
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 :-)
An often missed sorting method is the radix sort. It is extremely fast for data that is expected to be random. Because of the way IEEE floating point numbers are stored, you have to use a "stand in integer" representation of the doubles or floats. The "stand in" values are a bit fiddle on the floating point value that has the same sorting order but that work like 2s compliment integers.
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
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.
The first video I watch on your channel, subscribed in 24 seconds because you started sharing value quickly without a long unnecessary intro.
Same here, but I subscribed after reading your comment!
same
Agreed
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.
exactly
agree
amen
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.
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. 🙂
Really nice and informative video while still being short without "unnecessary" information, i really liked it
True
Video starts at 0:01
yeah no shit sherlock
thank you for warning me
my teacher gets paid 200k and he told me to refer to my knowledge from last semester. I find this guy free on UA-cam, college is wild. Thank you sir
You certainly have a knack for explaining things in an easily digestible way. Thanks.
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
Finally someone who is happy with C and doesn't cry 😃 Thank you for showing hope 🙏
@@thobiaslarsen8336 C rocks. Great language.
idk why this comment made me so happy
you go man! (or girl, lol)
Probably because there is a lot of negativity in the field right now, so its very refreshing to see something actually positive 😂
C is cool.
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!
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 👍
nlogn if data is unsorted i guess.
@@jonarielm then yup
nlogn to sort then logn to search
@@jonarielm you cant use binary search on unsorted array
@@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.
He even said "for sorted arrays"
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!
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!
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!!!👍
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
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!
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! ❤
Best explanation of dynamic programming ever. Thank you. ;-)
Almost 20 years into the game and I wish my CS teachers would have explained these algorithms this well. Great video.
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.
Amazing how easy you can simplify this hard algorithms visually , good job i really like it
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).
Good catch! Thanks for pointing that out.
Was just about to comment about this
@@TT-hi7lphahaha same here
Oh yep. Everyone was.
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.
leaving comment for boosting engagement because this channel deserve to grow even more!
Make a new playlist for all algorithms in depth videos. Thanks for the bite size explanation.
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.
straight to the point! One of the best Software/Web Dev channels out there!
More of this. Visual representation is stimulating, explanation is clear, analogies could be slightly more engaging, but are effective as is.
very straight to the point and zero clutter
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!
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.
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.
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!
showing which part of the code the is being ran live with the animation makes learning this much easier
One of the best videos I've seen for an introduction and basic explanation of important algorithms in computer science and programming. Awesome job! 👏
I like the visual for A* algorithm being how lightning connects to an upward streamer
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 UA-cam. 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.
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.
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!
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.
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.
Straight to the point, great graphics do illustrate, and as a bonus, no trademark "tech influencer" neon on background.
Subscribed, absolutely.
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
I wish every creator on UA-cam would watch your videos! To the point with no baloney. Thanks!
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.
Your a top man. Thank you. Hope you are blessed abundantly for all your efforts 🙏🏼
Truly enjoyed this, simple enough and yet leaves me wanting more. Well done
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!
Great video! I really like the visual depiction of Dijkstra's and A*.
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.
Well explained and condensed -- it's like crash course for algorithms. Great stuff!
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.
Break down the algorithms and data structures you think are necessary bro, these things are timeless!
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!
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!
Hey hey, Your talking style is amazing! The way you explained the algorithms is fabulous! I love it!
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!
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.
okay, I absolutely loved this and need more of this.
Yes, make more videos like this. I’m currently learning DSA
Really great explanations, thank you. This highlights where I came unstuck in AoC '23 quite well :)
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.
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.
Hey Forest, great wor and marvelous graphical representation. Please continue
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!🙏🏽
Oh man I would love a deep dive video on hashing algorithms, your stuff is great!
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 )
Landed here and subscrided in the first 15 seconds. Why? You went straight to the point. Thank you.
Great video. More "boring" algorithm videos please! Thank you for posting this.
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.
I appreciate that! Hearing this really means a lot
Thank you Forest, you've explained these concepts really well.
Superb content, excellent delivery! where were you when I was taking DS a few decades ago!
Make more videos like this. Informative content is what I’m here for
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.
this was kind of motivating, i'm off to learning quick sort as I skipped that because merge sort works
i have watched the entire video though
😭
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!
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!
That's gold content. Helping me alot on studies here 🤯
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.
Very nice graphics for your examples. Nice enough, i almost felt like i was watching an ad.
Keep these types coming (but also don't stop the long form too 😊)
Thank you for making this. Yes please, more of these!
Please do more of these types of video!!
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!
A mere 32 seconds in, a good start, a tree is a subclass of graph, i.e. every tree is a graph but not every graph is a tree -- saying the we know graphs as trees is a _bit_ wrong (see: Graph Theory)
yes bro! we want the hash algorithm and the rest too. as a developer this is refreshing and interesting
thanks for all those efforts that made to make those graphic explanation
Ι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.
Awesome video! Loved your explanation and the fact that you incorporate funny comments. Exited to see more.
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 :-)
An often missed sorting method is the radix sort. It is extremely fast for data that is expected to be random. Because of the way IEEE floating point numbers are stored, you have to use a "stand in integer" representation of the doubles or floats. The "stand in" values are a bit fiddle on the floating point value that has the same sorting order but that work like 2s compliment integers.
even being a retired engineer, I like stuff like this. keeps me thinking.
that a* visual was awesome, looked like lightening
As a developer, i always suscribe to a better devs channel. Well done
I always think that I have one kind of sort. This video literally blows my mind. Good vid.
Great videos.
Liking this nitty gritty concepts which are not popular in yt
We need more videos like this man..
Hope you're doing well. Thanks for sharing your knowledge and understanding of programming 🎉❤
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
I use the COMB sort for most of my applications. It's code is similar to the bubble sort but sorts much faster.
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.
Looking forward to the follow-up Forest!
Hm. For the second time someone from the screen tells me his name is Forrest, and for the secon time, the value of the content is great. Thanks!