Hello and thank you so much for your comment! That's really nice of you to say and I'm glad you think so, as that's exactly what I set out to do! Glad you found my work useful :)
Welcome back :) and congratulations on your recent marriage! I always enjoy your videos, and I was glad to hear your absence was just for work and nothing less pleasant.
Hello and thank you very much for your comment! Really glad to hear you like my work! Yes, I've just been busy is all, but ultimately this is where my roots are and I'd love to do more video work, circumstances permitting!
Im watching an old video of yours on sampling and jumped to this video. I think youre wildly entertaining with your videos but your audio lost good treble. as someone that messes with music, it was nice in the old video and makes it easier on the ears. Might be a change in the mic. That is all. Good content tho.
Hello and thank you for your comment! Yeah, I used to use a condenser mic at distance, so the quality is better at the expense of a lot more effort at noise removal. Now I'm using a cheap wireless mic, so that might explain the difference in quality.
I think you did not mention the case [1,1,1,1,1,1,1,1,1], this would be consistently O(n^2) unless you use Hoare, as it will still divide in even sized partitions when values are equal. I think this would have been worth mentioning. I did not really learn anything from the video as I already knew those things, but the explanation was clear and enjoyable!
Hello and thank you very much for your comment! Good shout, I completely missed the case in which all (or even most) of the elements are equal. Good point as well about Hoare's algorithm working well under these circumstances, thank you for sharing!
What a wonderfully clear explanation, thank you. You have a talent for breaking down complex ideas to their parts and elucidating them.
Hello and thank you so much for your comment! That's really nice of you to say and I'm glad you think so, as that's exactly what I set out to do! Glad you found my work useful :)
Welcome back :) and congratulations on your recent marriage! I always enjoy your videos, and I was glad to hear your absence was just for work and nothing less pleasant.
Hello and thank you very much for your comment! Really glad to hear you like my work! Yes, I've just been busy is all, but ultimately this is where my roots are and I'd love to do more video work, circumstances permitting!
Im watching an old video of yours on sampling and jumped to this video. I think youre wildly entertaining with your videos but your audio lost good treble. as someone that messes with music, it was nice in the old video and makes it easier on the ears. Might be a change in the mic. That is all. Good content tho.
Hello and thank you for your comment! Yeah, I used to use a condenser mic at distance, so the quality is better at the expense of a lot more effort at noise removal. Now I'm using a cheap wireless mic, so that might explain the difference in quality.
I think you did not mention the case [1,1,1,1,1,1,1,1,1], this would be consistently O(n^2) unless you use Hoare, as it will still divide in even sized partitions when values are equal. I think this would have been worth mentioning.
I did not really learn anything from the video as I already knew those things, but the explanation was clear and enjoyable!
Hello and thank you very much for your comment! Good shout, I completely missed the case in which all (or even most) of the elements are equal. Good point as well about Hoare's algorithm working well under these circumstances, thank you for sharing!