Implement the quicksort

- So now that we've seen the Quicksort theory,…let's actually implement the Quicksort for ourselves.…So here in VS code, I'm going to open up…the quicksort_start.py file.…And you can see, I already have some code…for a list of items that need to be sorted.…And I've already filled in the main Quicksort function,…so let't scroll down a little bit.…And down here, I print out the list of unsorted items,…and then call the Quicksort function…and then print out the finished sorted list.…

So since all of the work gets done in…the partition function, that's what…we are going to fill in.…And, again, just a quick recap,…remember that as long as we have the first and last indexes,…the first is less than last, we can calculate a pivot index…and then Quicksort the two partitions.…And we do this recursively until we no longer have…any partitions left to Quicksort.…So here, in the partition function,…I already have some code that establishes…the pivot value.…

And again, I'm just choosing the first position,…and then we're going to establish the lower…