Search posts, tags, users, and pages
Akshay Sushir
Full Stack Developer
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...
Kritika Pattalam Bharathkumar
Software Developer | Front End Web Development
Great Article!!
Thanks ๐, I will post other algos also
Candy
Cute X Software engineer X Pooh enthusiast
Great write-up Akshay Sushir and super clear!
We could also shorten the concat for result
concat
result
result = result.concat(left.slice(l), right.slice(r))
Tapas Adhikary
Educator @tapaScript | Founder CreoWis & ReactPlay - Writer - YouTuber - Open Source
Liked the article, Akshay. Please write about other sorting algos and their comparisons too.. ๐
Ya sure!
Kritika Pattalam Bharathkumar
Software Developer | Front End Web Development
Great Article!!