3 Types of Algorithms Every Programmer Needs to Know

preview_player
Показать описание
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!

Resources🔎

0:00 Why algorithms are important
1:35 Sorting Algorithms
5:44 Searching Algorithms
8:06 Graph Algorithms
12:29 Want more algorithm videos?

------------------------

Don't know why you'd want to follow me on other socials. I don't even post. But here you go.
Рекомендации по теме
Комментарии
Автор

The first video I watch on your channel, subscribed in 24 seconds because you started sharing value quickly without a long unnecessary intro.

mossabDiae
Автор

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

lukashuth
Автор

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.

softcolly
Автор

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 👍

nitheeshraajar
Автор

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

OGNord
Автор

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!

JustDevInc
Автор

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!

wille
Автор

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

BillyLongshot
Автор

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

User.Joshua
Автор

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!

Kamuisakeu
Автор

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

wolfmansaw
Автор

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

aggumbi
Автор

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.

TubeAccount-bf
Автор

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

jynxriZr
Автор

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

AndroniKTV
Автор

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

ademromdhane
Автор

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

rogueronin
Автор

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

daemon_zero
Автор

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

guitarman
Автор

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

cedrickmccallon