And Understanding O(N log N) Time Complexity

Some of the first algorithms you’re taught when taking an introductory computer science course, or when learning how to pass technical interviews, are sorting algorithms. There are a few reasons for this.

First, they are very intuitive to understand. Because we use sorting in our everyday lives to organize real things, this makes the problem setup trivial to explain: Your input is a list of unsorted things, and your job is to sort them.

In their most basic form, you are simply taking an unordered list of numbers and putting them into ascending order.

sort([8, 3, 5, 2, 4, 1, 7, 6])…


Sergey Piterman

Technical Solutions Consultant @Google. Software Engineer @Outco. Content Creator. Youtube @ IG: @sergey.piterman. Linkedin: @spiterman

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store