2020-11-27

#include <bits/stdc++.h>
using namespace std;
void insertionSort(int arr[], int left, int right) 
{ 
    for (int i = left + 1; i <= right; i++) 
    { 
        int temp = arr[i]; 
        int j = i - 1; 
        while (j >= left && arr[j] > temp) 
        { 
            arr[j+1] = arr[j]; 
            j--; 
        } 
        arr[j+1] = temp; 
    } 
}
void merge(int arr[], int l, int m, int r) 
{ 
      

    int len1 = m - l + 1, len2 = r - m; 
    int left[len1], right[len2]; 
    for (int i = 0; i < len1; i++) 
        left[i] = arr[l + i]; 
    for (int i = 0; i < len2; i++) 
        right[i] = arr[m + 1 + i]; 
  
    int i = 0; 
    int j = 0; 
    int k = l; 
  

    while (i < len1 && j < len2) 
    { 
        if (left[i] <= right[j]) 
        { 
            arr[k] = left[i]; 
            i++; 
        } 
        else
        { 
            arr[k] = right[j]; 
            j++; 
        } 
        k++; 
    } 
  

    while (i < len1) 
    { 
        arr[k] = left[i]; 
        k++; 
        i++; 
    } 
  

    while (j < len2) 
    { 
        arr[k] = right[j]; 
        k++; 
        j++; 
    } 
} 

//充分利用待排序数据可能部分有序的事实，并且依据待排序数据内容动态改变排序策略——选择性进行归并
//使用插入排序对小块进行排序，然后使用合并排序的合并对小块进行合并。
void timSort(int arr[], int n) 
{ 
    // 将run段设为32 
    for (int i = 0; i < n; i+=32) 
        insertionSort(arr, i, min((i+31), (n-1))); 
   
    for (int size = 32; size < n;  size = 2*size) 
    { 
        //不停的合并成大段  
        for (int left = 0; left < n;  left += 2*size) 
        { 
              
            int mid = left + size - 1; 
            int right = min((left + 2*size - 1),  (n-1)); 
  
            merge(arr, left, mid, right); 
        } 
    } 
} 

void printArray(int arr[], int n) 
{ 
    for (int i = 0; i < n; i++) 
        printf("%d  ", arr[i]); 
    printf("\n"); 
}  
int main()
{
    

    int arr[] = {-2, 7, 15, -14, 0, 15, 0, 7, -7,  
                       -4, -13, 5, 8, -14, 12}; 
    int n = sizeof(arr)/sizeof(arr[0]); 
    printf("before:\n"); 
    printArray(arr, n); 
  
    timSort(arr, n); 
  
    printf("After:\n"); 
    printArray(arr, n); 
    return 0;
}