FFS Microsoft

[AtW]

QuickSort is not always the most efficient - it depends on distribution of data and its possible to find cases that increases its runtime badly.

[AtW]

Just look how they swap values in their sort:

byte item = items[i];
items[i] = items[j];
items[j] = item;

They use temporary variable to do that, no doubt this requires little thinking

[scotspine]

"know better, but I am not the best programmer out there" - come come atw, we know you know that's not the case!


"They use temporary variable to do that" - ok, i'll bite, show me the atw way without a temp var...

[ratewhore]

[bogeyman]

Just look how they swap values in their sort:

byte item = items[i];
items[i] = items[j];
items[j] = item;

They use temporary variable to do that, no doubt this requires little thinking

Just out of interest - how did you do it ?

[Jabberwocky]

QuickSort is not always the most efficient - it depends on distribution of data and its possible to find cases that increases its runtime badly.

what do you know that isn't basic Knuth my little russian puppy.

[Jabberwocky]

Just out of interest - how did you do it ?

I could point you in the right direction but I'll let the ruskie show his ballcocks.

[AtW]

"They use temporary variable to do that" - ok, i'll bite, show me the atw way without a temp var...

Check out #1 result in SKA

[bogeyman]

I could point you in the right direction but I'll let the ruskie show his ballcocks.

Yep, let's see 'em

[bogeyman]

Check out #1 result in SKA

So, which method did you use, and why are you sure it's faster than using an intermediate variable (when the compiler does a lot of optimising).

Using the intermediate var is obvious and makes for easy-to-understand, maintainable code. Do you like to obfuscate your code to show how clever you are?