In Shellsort, how are the sublists sorted?

Using Insertion Sort because Shellsort generally makes each subarray reasonably close to sorted
  • Using any sort that you like, it doesn't matter so long as they are sorted
  • Using Quicksort, because this is generally the fastest sort
  • Using bubble sort since that is the most appropriate sort in this situation
  • Using Shellsort since this is a recursive algorithm

Shellsort isn't really recursive, is it?

The sort that you use on sublists really does matter.

Do you remember why Shellsort sorts sublists?

Recall that the main purpose for sorting sublists in the first place is to make the list closer to sorted.

Which sorting algorithm is fast when it sorts a list already nearly sorted?