shell sort's best case time looks wrong: O(log n)

[murraycu]

O(log n) time seems odd for any sort algorithm. Wikipedia lists shell sort's best case as O(n log n):
https://en.wikipedia.org/wiki/Shellsort

[josem]

Hi @murraycu, so sorry for the huge delay on this one. You are totally right, it should be fixed now :).

Thanks so much!