It’s a cool language but some of the syntax can just fuck offff

Please do more videos about other algorithms and their application on real life like Dijkstra or A*. The animation that you use is very useful to understand those.

Pro tip: Learn it if you have a personal concurrency project to implement in it that you intend to maintain for years to come. Do not learn it to get a new job in it, as the jobs are extremely rare, and moreover they require years of experience.

awesome video

You can remove the browser part by using a web scraping framework that works without a browser instance.

Also very useful when you can test if a value is too small or too large, but not the desired value. Such as an auto grow text area.

I feel like we need Donald Knuth to reply to this. "Premature optimization is the root of all evil." Never implied that you should not ever optimize your code for any reason. And I kind of feel like that's what the "more readable" advocacy is for. I spent an entire entire semester using recursion and dynamic memory allocation. Just for the last few classes to tell you, you could do all the same things using arrays and it's way faster.

Great video. Could you please tell me what font you are using?

I really feel so lucky that i found your channels Please keep up on the content, can't wait to see your channel grows well and get what it deserves ❤🔥.

One of the reasons to prefer linear search over binary search is the cache, since reading one value will make the CPU implicitly fetch the values around it, and if you can use those rather than discarding all of them and jumping away, then the fewer data transfers can actually trump the fewer operations of the binary search. However it is actually possible to get the best of both worlds, with fewer comparisons while still respecting the cache. It just requires an unusual form of sorting. The structure is similar to an array-backed heap, but the order of the nodes is that of a traditional binary search tree. This type of structure was first described by Michaël Eytzinger in 1590 for efficiently searching through genealogical data and a person's ancestry... on paper.

anyone know what font is used in the code snippets?

Unlike b- or binary trees a sorted array has zero (pointer) overhead, so it’s great when it can be pre-calculated and is static.

This video is the greatest example of explanation. You even care for edge cases of the algorithm. I love that detail at 2:01. The animations are great, too! This video is truly a masterpiece.

Hey, i just want to know with what tool do you make this smooth and beautiful presentations and thanks guys

I'm new to rust and take what I'm gonna say with a grain of salt I could be wrong, but In chapter 10 you mentioned that the compiler will complain if your state type doesn't implement send + sync + clone, however the compiler only complained cause clone isn't implemented, so you just had to do that in order for the code to compile. I know that wrapping the hashmap with arc and read write lock would make the state thread safe for read and writes but still hashmap auto implement sync + send if you look at the docs.

Great vid!

I really enjoyed it, especially the awesome animations. question: If I want to learn data structures and algorithms, where should I begin? Can you recommend a KZbin channel?

this knowledge is gold..

Amazing video as always! If only everybody taught this efficiently on KZbin 😄

5:54 the only thing better than the Lost reference is the rest of the video

Hoping for B-tree ds in the next video

4 8 15 16 23 42

I love your appreciation of Lost

I'll share this one with my friends, very informative!

new CS playlist loading?

Elegant as always! Also, nice play there with the git dates and commit messages!

Loved the video and the animation just great hope to see more of this kind of video may be one on breadth first search. ❤️

Would love a video going into the differences between binary trees and B-trees.

I wish I had this video back in my first Uni semester 😭

code aesthetic, dreams of code similar logo similar video style so much confusion

Such a great video! Thanks!

Most arrays are small. A linear scan is fine for small arrays. Larger amounts of data are typically stored in databases which do not used arrays (generally) and are generally based on B-tree as mentioned in the video. B-tree is quite different from binary trees in concept.

The quality of the animation of this video is really really impressing.

Can you do quicksort and mergesort?

In french we call it "recherche dichotomique". But the array needs to be sorted first.

I hope people support these type of videos, instead of those IT drama shows.

hello everynyan

binary search is used in Blind SQL Injection attacks

Nice little XZ reference you snuck in 🤭

loved this. please if possible do make more videos on algorithms and data structures.

first

1 min no views

GIB MORE PostgreSQL's VIDEOS >:(

Dreams of code makes really good videos but as a frontend dev learning go, I gotta watch his vids on 0.75 speed...

But what if the container stops right after it shows the log message? I'm having this problem in a small application and I can't find any function that checks the health of the container even after it stared... :(

Sorry bro, it didn't work and doesn't shows the install plugins just like you showed on the video.

How to disable SIGUSR2 during debug with dap and nvim ? Thanks.

2:20 if you build release mode, it seems it resolves it automatically

Can you make a video about customization of ZSH? Maybe comparison with Fish? omz, omf, p10k, etc. And something about shell configuration, maybe dotfile managers video? chezmoi, makup, etc.

for silicon, is there a way to bypass saving the screenshot, and just directly copy it to your clipboard?