Python data structures and algorithms 11th day "Hill Sort"

1. The principle of hill sorting

2. Code implementation

defShell_sort (alist): N=Len (alist)#Initial StepGap = N/2 whileGap >0:#Insert Sort by step         forIinchRange (Gap, N): J=I#Insert Sort             whileJ>=gap andALIST[J-GAP] >Alist[j]: alist[j-GAP], alist[j] = alist[j], alist[j-Gap] J-=Gap#get a new step sizeGap = GAP/2alist= [54,26,93,17,77,31,44,55,20]shell_sort (alist)Print(alist)

Attention:

(1) Hill sort uses the idea of splitting up and merging, splitting apart

3. Complexity of Time

Optimal time complexity: varies by step sequence

Worst time complexity: O (n2)

Stability thinking: unstable

Python data structures and algorithms 11th day "Hill Sort"