Learn Merge Sort in JavaScript
Join 549 other students
Log in to get
Subscribe to access to this course and ALL other courses. You get a 30-day money-back guarantee, no questions asked.
Subscription includes
with Jonathan Lee Martin
Course level: Advanced
In this course, you'll practice your software craftsmanship skills by coding six different merge sort algorithms. Each solution will teach you a new technique for solving problems as a software developer and level up your computer science skills in general.
What's inside
This course contains 11 interactive screencasts
You'll learn
Merge Sort
Imperative
Array splitting
Array view
Queue
Cursor
Cursor + ArrayView
Simple
Improving your CS skills
Crafting exceptional code
Prerequisites
This course is recommended for bootcamp graduates or working developers who have a good knowledge of JavaScript.
Meet your teacher
Jonathan Lee Martin
📖 Author ⚛️ Educator 👨🏫 International speaker 🎒 Digital nomad 📸 Photographer @ Yellowscale.com
Follow me on twitterWhy this course rocks
The course follows on from Jonathon Lee Martin’s Working Developer’s Guide to Algorithms and aims to help working developers or bootcamp graduates to step up their software design skills by learning to think algorithmically.
Along the way, you'll learn to code six alternative implementations of the Merge Sort algorithm, as well as algorithm analysis and a handful of powerful design patterns.
By the end, you’ll be more confident in your CS skills and have sharper problem-solving skills to boot.
to the QWho is this course for?
This course is perfect for people who are already coders (bootcamp graduates or working developers) and wish to learn the Merge Sort algorithm and level up their computer science skills in general.
