Why is Radix Sort so Fast? Part 1 Why are Comparison Sorts so Slow?

Support What’s a Creel? on Patreon: Office merch store: FaceBook: 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: Blender: OBS: Davinci Resolve 16: OpenOffice: Gimp: 80’s 3D neon effect in the thumbnail is from Ducky 3D’s: Background HDRI from thumbnail and intro is from HDRI Haven: