This is ackshually the last of the "Array" section
To help understand divide and conquer we are going to implement QuickSort. Its an incredibly simple and impressive algorithm.
You may have forgot, but I did say we have 2 sorts to do.
What is Divide and Conque?
First, Lets go over the QuickSort Algorithm
This truly is a fun algorithm to implement
MIT Battlecode
A group of us got 13th at MIT battle code and one of the algorithms we had to use was quicksort (i did not go to MIT)
Running Time?
(to the whiteboard)
Next, we implement
To NeoVim. The truest and greatest vimming experience ever...
Did you know I taught a course on vim?
My Course on Vim
