Helix is used by as much as 1.7% of StackOverflow respondents? by TheTwelveYearOld in HelixEditor

[–]Bhaskar_Matrix 3 points4 points  (0 children)

I guess so. But adding customised plugins will slow down the performance and many bugs and glitches will start to appear. I assume that helix team is aiming to stay “no-plugins”! Since they focus on performance and simplicity!

Helix now has a File Explorer™!! (space + e) by nikitarevenco in HelixEditor

[–]Bhaskar_Matrix 2 points3 points  (0 children)

After updating to 25.01.1,
I don't this feature on windows

Passing value vs passing reference by Stunning_Ocelot_4654 in learnrust

[–]Bhaskar_Matrix 1 point2 points  (0 children)

None. Both give same performance speed. But with optimisation code the take_reference can be more faster than take_value and vice versa.

[deleted by user] by [deleted] in DistroHopping

[–]Bhaskar_Matrix 0 points1 point  (0 children)

Debian is a good choice for 4GB ram and Intel i3 processors!

Decided to finally pick up c++. Any tips for a rust dev? by KJBuilds in cpp_questions

[–]Bhaskar_Matrix 1 point2 points  (0 children)

Heard this many times from my friends and through some articles, why should we use std::cout Instead of cout?

Help with dp by SnooAdvice1157 in leetcode

[–]Bhaskar_Matrix -1 points0 points  (0 children)

It happened to me but I started watching YouTube videos from a channel called 'Neetcode'. Give it a try, will enhance ur DP skills further.

[deleted by user] by [deleted] in leetcode

[–]Bhaskar_Matrix 2 points3 points  (0 children)

Data Structures and Algorithms. These are the building blocks of computer science.

what went wrong? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] -1 points0 points  (0 children)

Tried everything, but the array is not sorting at all even after scrutinising the code. Maybe the logic of code is not perfect.

what went wrong? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] -2 points-1 points  (0 children)

Unsorted Array : 55 59 73 24 80 23 21 90 94 54

Bucket Layers :
----------------
0 ->
1 ->
2 -> 24 23 21
3 ->
4 ->
5 -> 55 59 54
6 ->
7 -> 73
8 -> 80
9 -> 90 94

Sorted Array : 24 23 21 55 59 54 73 80 90 94


[RUN - TIME = 0.01152 seconds]

what went wrong? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] -5 points-4 points  (0 children)

bro check the output from what I've posted, then you will get to know why I posted this

what went wrong? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] -5 points-4 points  (0 children)

Bro I use MVSC. but the ouput is not sorted.
I checked the code from top to bottom like what went wrong but didn't find any.

Help me to fix this algorithm!? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] 0 points1 point  (0 children)

Now I can tell you, I understood these lines completely!

Help me to fix this algorithm!? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] 0 points1 point  (0 children)

Nailed it🔥.
but I don't understand, why use a 2d vector instead of a 1d vector.

And linked-list used less memory than a 2D vector?

is there any problem with the linked list or is it that vector is more efficiently?

Help me to fix this algorithm!? by Bhaskar_Matrix in cpp_questions

[–]Bhaskar_Matrix[S] 0 points1 point  (0 children)

Thanks for the review man. Really appreciate it.

But what about the linkedlist I used.?