Quick Sort
Based on the idea that we can partition an array around a pivot (chosen element of the array), we can put the smaller (than pivot) elements on the left side and place greater elements on the right side of the pivot, then, we keep doing the same thing for the left side and the right side. More details of how this algorithm works is on "How it works" section.
Insight into V8 Build System
Please be aware of notation below in command outlines. $ represents a command and rests of the lines following that line are output.