Відео

You should do it in parallel, where your total number of partitions is the same as the number of channels supported by your CPU (4 or 8 most common I believe), but not greater than the number of CPUs available.

It is not clear what capacity is? Because according to Wikipedia the probability of the error depends on count of inserted elements. So Wikipedia uses ‘n ‘ in computation of error’s rate where n is count of inserted elements.

Very very interesting compilation of videos

I loved the video, thank you very much for the explanations. Just to clarify my understanding, the copy problem when using a List<>. The problem would be because Parse is returning a List<> of structs and in the code below in foreach it would be copying the object to the loop's local variable? foreach (var line in lines) { sum += line.Amount; }

nice

wow, it is really powerfull.

what if instead of multiplying you fill up the whole integer with the first bit from the & 1 result and & that with p[x]

Great video. I would only recommend to work on a proper naming convention, as you named all of the tested methods with quite generic (nothing saying) names.

I want a course from you, bro... I am loving you series about C# and high performance coding

You can relate this to cryptocurrency

Ставлю полтос что автор русскоговорящий)))

Wow thank you so much, all solid performance tips, cheers

Why is the array of bytes 20 bytes long when u have 4 ints in them? 4x4byte I thought it is?

Why not just use C for performance? Code readability is more important than extra 30 milliseconds

for (int i = 0; i < array.Length; i += 2) sum += array[i];

after spending time in the LeetCode Community, always force a HashMap at the problem🤣🤣

You're ruining readability, but atleast its a second faster

great work and explanation, but it would be better without the background music

There's a potentially faster version of your no-multiplication bit hacks: // For n-bit integers, use a shift of (n-1) counter += value & (value & 1) << 31 >> 31; To explain it, I'll use 8-bit integers for brevity: 1. (value & 1): is the value odd? 2. << 31: move the pseudo-boolean value to the sign bit 3. >> 31: perform a sign-extending(!) shift to the right, essentially creating a move mask 4. value &: use the move mask to either zero out or keep the value It'll look something like this: Value: 5 1. (0b00000101 & 1) = 1 2. 1 << 7 = 0b10000000 3. 0b10000000 >> 7 = 0b11111111 4. 0b00000101 & 0b11111111 = 5 Value: 6 1. (0b00000110 & 1) = 0 2. 0 << 7 = 0 3. 0 >> 7 = 0 4. 6 & 0 = 0 This method eliminates not only the multiplication, but also the subtraction. Would be interested to see if it's actually faster, though

I was frankly suspicious of C# properties/accessors when I first learned of them, but they were so built into every example I came across that I figured there was something magical they were doing that I didn't understand. I've since just gone back to public fields as I find them easier to reason about. So much example C# code has a private backing field and a public property that just returns the private field (before the simplified get; set;).

I didn't know that Sam from LOTR knows C# XD :D

Can you share you program that visualize bit expressions? Thanks

The code highlighting is such a great idea! Well done :)

Is using span similar to using the pointer?

Bit or byte?

What editor was used to edit the video?

best animation, worst explanation in detail

I have no idea what any of this means, clearly I'm still too green

The bug that you've mentioned at method B2 (8:06) seems not to be there anymore at .NET 7. However, the value of variable 'l' will be copied to eax register and it will be used later for the bound checking even though it's marked as unused at the front end code. And again thanks for the great video.

That was so insightful. Thanks for the great video.

The presentation is top notch. =)

Could you also make some videos about the differences in output on different operating systems? It seems like on Linux / Mac even the MS version of dotnet (the dotnet/runtime) essentially uses the merged in Mono under the hood. As a result a lot of code output and performance characteristics work completely differently to what happens in the WIndows world.

Kudos for the effort to create those videos Sir! It looks efortless but I know that this is a lot of work.

Video style toh bole toh ekdumm zhakaassss....

Any use at this in a real word use case. Also if you really wants perfomance in this you can use: var sum = n/2 * ( 2*a + ( n - 1 )* d );

Super, jeszcze szczeke zbieram z klawiatury! Dobry pomysl!

how is this all done ? can you teach this or drop the sources for learning .

in groupByLookup you dont deal with collisions,and when i see the imp of groupBy provided by Microsoft it look very similar to yours , so why the performance gap is hug ?!

And the second part? (btw great video!)

The fairly new SSD.M2 via PCI-Express 4 is about 7-8 GB/s actually.

Why do you use k hash functions instead of extracting the kth bit from the output of one hash function?

How to achieve high performance in C# : Rewrite it in C++

In fact, we rarely use Array in real world. Furthermore we can use multitasking for CPU-bound tasks or asynchronous for I/O-bound tasks to improve performance

So awesome!

There's a point where readability is worth more than a tiny bit of performance

good info,,, RLE/RLL was used in the first hard drives interfaces... ;-)

very interesting... thanks!

wow... such a good info tool...

you're amazing Bartosz!

This is a masterpiece.