i wonder what sorting algorithm people tend to use when sorting things
like if you give someone a pile of cards with numbers on them and ask them to sort them what is their thought process like
probably insertion sort?
definitely insertion sort if you give someone an already sorted list and a small collection of things to add to it in the proper location--like putting back library books
I could see people doing something quicksort-y in the former situation though
-F
@Felthry insertion short has a big advantage with physical objects because shifting the rest of the list over is free
I think that's what we commonly go for - occasionally dividing into batches first (e.g. suits for playing cards)
- 🎒
@packbat yeah, though insertion is also generally really good for adding a new item to an already-sorted list! It's just for the initial sort it's a bit less than perfect
-F
@packbat (it's also really good for small lists, faster than some nominally faster sorts like merge sort and quicksort)
-F
@Felthry I tend towards Radix (MSD) or Quicksort on larger item sets.