折半(二分)插入排序

 
 

  
  #!/usr/bin/python


 
 
 
 

  
  #coding: utf-8


 
 
 
 


 
 
 
 

  
  def 
  
  binary_insert_sort
  
  (
  
  li
  
  , 
  
  num
  
  ):

 
 
 
 
    
  
  "折半插入排序"

 
 
 
 
    
  
  for 
  
  i 
  
  in 
  
  range
  
  (
  
  1
  
  , 
  
  num
  
  ):

 
 
 
 
        
  
  key 
  
  = 
  
  li
  
  [
  
  i
  
  ]

 
 
 
 
        
  
  left 
  
  = 
  
  0

 
 
 
 
        
  
  right 
  
  = 
  
  i 
  
  - 
  
  1

 
 
 
 
        

 
 
 
 
        
  
  # 查找当前可以防止的位置


 
 
 
 
        
  
  while 
  
  left 
  
  <= 
  
  right
  
  :

 
 
 
 
            
  
  middle 
  
  = 
  
  (
  
  left 
  
  + 
  
  right
  
  ) 
  
  // 
  
  2

 
 
 
 
            
  
  if 
  
  key 
  
  >= 
  
  li
  
  [
  
  middle
  
  ]:

 
 
 
 
                
  
  left 
  
  = 
  
  middle 
  
  + 
  
  1

 
 
 
 
            
  
  else
  
  :

 
 
 
 
                
  
  right 
  
  = 
  
  middle 
  
  - 
  
  1

 
 
 
 
        

 
 
 
 
        
  
  # 都往后移位，用来放置key


 
 
 
 
        
  
  for 
  
  j 
  
  in 
  
  range
  
  (
  
  i 
  
  - 
  
  1
  
  , 
  
  left 
  
  - 
  
  1
  
  , 
  
  -
  
  1
  
  ):

 
 
 
 
            
  
  li
  
  [
  
  j 
  
  + 
  
  1
  
  ] 
  
  = 
  
  li
  
  [
  
  j
  
  ]

 
 
 
 
        
  
  li
  
  [
  
  left
  
  ] 
  
  = 
  
  key

 
 
 
 


 
 
 
 

  
  if 
  
  __name__ 
  
  == 
  
  "__main__"
  
  :

 
 
 
 
    
  
  li 
  
  = 
  
  [
  
  95
  
  , 
  
  45
  
  , 
  
  15
  
  , 
  
  78
  
  , 
  
  84
  
  , 
  
  51
  
  , 
  
  24
  
  , 
  
  12
  
  ]

 
 
 
 
    
  
  binary_insert_sort
  
  (
  
  li
  
  , 
  
  len
  
  (
  
  li
  
  ))

 
 
 
 
    
  
  print 
  
  li