常见排序算法-Python实现

常见排序算法-Python实现

python

排序

算法

1.二分法

    python    32行

1. ---

2. right = length- 
   

   ---

3. : 
   

   ---

4. ]  
   

   ---

5. ---

6. ): 
   

   ---

7. ---

8. ---

9. ---

10. ---

11. test_list = [,,,,,,] 
    

    ---

12. test_val1 =  
    

    ---

13. test_val2 =  
    

    ---

14. ): 
    

    ---

15. length = len(array) 
    

    ---

16. ---

17. : 
    

    ---

18. : 
    

    ---

19. ): 
    

    ---

20. ]: 
    

    ---

21. array[i],array[i+] = array[i+],array[i] 
    

    ---

22. length -=  
    

    ---

23. : 
    

    ---

24. : 
    

    ---

25. ): 
    

    ---

26. ]: 
    

    ---

27. array[i],array[i+] = array[i+],array[i] 
    

    ---

28. length -=  
    

    ---

29. ): 
    

    ---

30. is_sorted = : 
    

    ---

31. ): 
    

    ---

32. is_sorted = ]: 
    

    ---

33. array[i],array[i+] = array[i+],array[i] 
    

    ---

34. is_sorted =  
    

    ---

35. : 
    

    ---

36. ): 
    

    ---

37. is_sorted = ]: 
    

    ---

38. array[i],array[i+] = array[i+],array[i] 
    

    ---

39. is_sorted =  
    

    ---

40. , , , , , , , , , ]  
    

    ---

41. print(better_bubble_sort(test,)) 
    

    ---

3.插入排序

    python    19行

1. ] 
   

   ---

2. ,length): 
   

   ---

3. ]: 
   

   ---

4. flag = array[x] 
   

   ---

5. y = x 
   

   ---

6. ] > flag : 
   

   ---

7. array[y] = array[y-] 
   

   ---

8. y -=  
   

   ---

9. array[y] = flag 
   

   ---

10. , , , , , , , , ] 
    

    ---

11. print(insert_sort(test)) 
    

    ---

4.归并排序

    python    31行

1. : 
   

   ---

2. ---

3. left = merge_sort(array[:split_index]) 
   

   ---

4. right = merge_sort(array[split_index:]) 
   

   ---

5. ---

6. j =  
   

   ---

7. result = [] 
   

   ---

8. ---

9. ---

10. ---

11. result += (left[i:]) 
    

    ---

12. result += (right[j:]) 
    

    ---

13. ,] 
    

    ---

14. test = [, , , , , , ]  
    

    ---

15. print(merge_sort(test)) 
    

    ---

5.选择排序

    python    16行

1. , , , , , , , , ]  
   

   ---

2. print(select_sort(test)) 
   

   ---

6.快速排序

    python    26行

1. ---

2. lists[left] = lists[right] 
   

   ---

3. ---

4. lists[right] = lists[left] 
   

   ---

5. lists[right] = key 
   

   ---

6. quick_sort(lists, low, left - ) 
   

   ---

7. quick_sort(lists, left + , high) 
   

   ---

8. , , , , , , , , , ] 
   

   ---

9. ,len(test)-)) 
   

   ---

---

written by MARSGGBO 
2017-2-14