#Day13 #100DaysOfCode
an extension to insertion sort.
compared values in between range. some refer to as intervals or gaps.
in other words, not swapping adjacent elements but elements in far distance.
time complexity: O(nlogn)
it is an unstable sorting algorithm because it doesnt take into account the values in between the interval.
the performance of shellsort depends on the type of sequence used. i.e: Shell's original sequence: N/2 , N/4 , …, 1
an extension to insertion sort.
compared values in between range. some refer to as intervals or gaps.
in other words, not swapping adjacent elements but elements in far distance.
time complexity: O(nlogn)
it is an unstable sorting algorithm because it doesnt take into account the values in between the interval.
the performance of shellsort depends on the type of sequence used. i.e: Shell's original sequence: N/2 , N/4 , …, 1
