Support What's a Creel? on Patreon:   / whatsacreel  
Office merch store: https://whats-a-creel-3.creator-sprin...
FaceBook:   / 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: https://www.visualstudio.com/downloads/
Blender: https://www.blender.org/
OBS: https://obsproject.com/
Davinci Resolve 16: https://www.blackmagicdesign.com/prod...
OpenOffice: https://www.openoffice.org/
Gimp: https://www.gimp.org/


80's 3D neon effect in the thumbnail is from Ducky 3D's:    • Blender - 80's Style Animation Loop i...  


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