Hi, everyone.
So in the last few, do we write the code for the quicksort function and the partition function, but
I forgot to test our function.
So in this video, I will just test my function so that I can check whether everything is working fine
or not.
So let's say the array elements are basically so two, one, three, four, five and seven.
So these are my elements.
Let's call the function quicksort.
So I will pass Eddie, I will pass the starting next, which is zero, and last year next is basically
one, two, three, four, five, six, six elements.
Is there the last?
Next will be five.
And let us sprint already.
So I equals zero eight.
Less than six.
I placeless and let us sprint my area.
So now let's test our function.
So basically, our debt is getting started.
One, two, three, four, five, six and seven.
So these are the even number of elements let's check for our number of elements.
Also seven and let's make it minus two.
So the last word next will be six and the number of elements is basically seven.
So our function is still working.
OK, so our function is fine.
So this video is only for testing of the function.
Quicksort and function is working fine.
So this is it from this video.
I will see you in the next one.
Thank you.