Does anyone have an opinion on which of these sorts would work best on a small array: quick sort, insertion sort, or selection sort?

i'd say quick sort. There's also a radix sort, but it wont be faster than quick sort unless you have a lot of data

Does anyone have an opinion on which of these sorts would work best on a small array: quick sort, insertion sort, or selection sort?

Well, that depends on array's elements. If array is almost sorted, then insertion sort would be my choice. If quick sort is implemented recursively than, I don't think quick sort is good idea...

Cheers!

Be a part of the DaniWeb community

We're a friendly, industry-focused community of 1.18 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.