Question about your merge sort!

[mspanish]

Hello and congrats on your upcoming book! I look forward to it, and am delighted to see that you are a a woman :)

I am just working with merge sort algos for the first time, and see you've got a slightly different thing going on here - the

result.push(left[il++]);

instead of using result.push(left.shift()) - which seems to be what I've seen elsewhere. Does eliminating the shift() help performance?

thanks for all your samples and best of luck w/ the book launch.

Obrigada desde Alaska
Stacey

[loiane]

Hi Stacey,

Thanks!

The shift method removes an element from the array, while left[il++] access the element only. Accessing the element is a cheaper operation rather than removing it.

Have a nice day!

[mspanish]

Thanks very much Loiane - I've just gotten my brain around left[i++], and I really appreciate your response! Your book will be very fun to look at, I hope it comes out in Kindle form so I can use it on my phone. I hope you sell many copies :)

[anthonybrown]

I just discoverd your book, and want to point out an error in the first example of arrays.
You forgot to create the averageTemp array.
var averageTemp = []; then the averageTemp[0] = 31.9; averageTemp[1] = 35.3; averageTemp[2] = 42.4; averageTemp[3] = 52.0; averageTemp[4] = 60.8;

works.
Looking forward to read the book for review.

[anthonybrown]

I see that you have an example of it on the next page :)

How do I help you if I find more typo's and errors?

[loiane]

Thanks Anthony. If you find errors, you can create issues here! Thanks again!

[ryanpoplin]

Hey Loiane, thanks for writing this book. It's awesome to be able to jump into the concepts with having to learn all of the mathematical notations in conjunction with C || Java!

[ryanpoplin]

without*

[loiane]

Thanks Ryan! Hope you like it! :)