00:01
Okay, so for this problem we're going to be doing a quick sort algorithm.
00:04
And we're going to be using our pivot of 14.
00:06
So this is our pivot.
00:08
And we're going to use a left pointer here.
00:10
So our left pointer and a right pointer.
00:14
Right, our right pointer is going to go from right to left and this one's going to go from left to right.
00:18
And our left pointer is responsible for looking at numbers that are greater than.
00:22
So this is going to be greater than or equal to and this one's less than or equal to.
00:26
And if both of these things comply then we're gonna, then what we'll do is we'll kind of swap these numbers.
00:33
So we'll start off with 17 and 12.
00:36
This one's greater than and this one's less than.
00:38
So we're going to swap them.
00:40
And i'm going to have it that 14 is essentially in the middle because that's our target node here.
00:45
So we're going to have, we're going to swap our 12, right, because that's less than and our 17 which is greater than.
00:54
So this makes perfect, perfect.
00:56
So we're going to cross out this and this...