Hello folks! π, we all often run into the situation where we need an efficient algorithm for sorting. And today I'm implementing the Merge sort algorithm in JavaScript. With this, we can move from the O(n^2) algorithms to a much more scalable O(nlog...

Markdown supported Β· ββ΅ to post
Akshay Sushir
Great write-up Akshay Sushir and super clear!
We could also shorten the concat for result
result = result.concat(left.slice(l), right.slice(r))
Liked the article, Akshay. Please write about other sorting algos and their comparisons too.. π
Kritika Pattalam Bharathkumar
Software Developer | Front End Web Development
Great Article!!