C# : Why is List T .Sort using Comparer int .Default more than twice as fast as an equivalent custom
C# : Why is List T .Sort using Comparer int .Default more than twice as fast as an equivalent custom comparer?
To Access My Live Chat Page,
On Google, Search for "hows tech developer connect"
So here is a secret hidden feature I promissed to tell you.
This is a YouTube's feature which works on Desktop.
First, Make sure the video is currently in playing mode.
Then, type the letters 'awesome' on the keyboard.
Your YouTube progress indicator will turn into a shimmering rainbow.
A quick introduction about me,
Good day, I am Delphi.
Let me assist you in answering any questions you may have.
C# : Why is List T .Sort using Comparer int .Default more than twice as fast as an equivalent custom comparer?
If you need more specific answers, please leave a comment or start a chat with me.
If you have an answer or any additional information on the answer, please leave a comment below.
I will express my appreciation for your answer by 'hearting' it.
comparer? using as List .Sort T equivalent custom int twice than : Why fast as .Default Comparer is more C# an