Uploaded September 2020 | Updated September 2026, 2 weeks ago

---

Support What's a Creel? on Patreon: patreon.com/whatsacreel
Office merch store: whats-a-creel-3.creator-spring.com
FaceBook: facebook.com/whatsacreel



In this 3 part series, we will explore sorting algorithms from the fundamentals all the up to implementations of both a comparison sort and a base 256 Radix Sort.

In this first video, we explore why Comparison Sorts have a speed limit: O(nLogn).

Software used to make this vid:
Visual Studio 2019 Community: visualstudio.com/downloads
Blender: blender.org
OBS: obsproject.com
Davinci Resolve 16: blackmagicdesign.com/products/davinciresolve
OpenOffice: openoffice.org
Gimp: gimp.org


80's 3D neon effect in the thumbnail is from Ducky 3D's: youtube.com/watch?v=hnLsktA4gmY&t=240s


Background HDRI from thumbnail and intro is from HDRI Haven: hdrihaven.com