algorithm/003A_ShellSort.py at master · lixinchn/algorithm · GitHub

Repository navigation

23 lines (19 loc) · 717 Bytes

# http://blog.csdn.net/morewindows/article/details/6668714

class ShellSort():

def __init__(self):

self.data = [10, 14, 73, 25, 23, 13, 27, 94, 33, 39, 25, 59, 94, 65, 82, 45]

def do(self):

data_len = len(self.data)

gap = data_len / 2

while gap > 0:

for i in range(gap, data_len):

if self.data[i] < self.data[i - gap]:

j = i

while j - gap > 0 and self.data[j] < self.data[j - gap]:

self.data[j], self.data[j - gap] = self.data[j - gap], self.data[j]

j -= gap

gap /= 2

if __name__ == '__main__':

ss = ShellSort()

ss.do()

print ss.data