# 直接插入排序
def insert_sort(arr):length = len(arr)for i in range(length):k = ifor j in range(k,0,-1):if arr[j]<arr[j-1]:t = arr[j]arr[j]=arr[j-1]arr[j-1]=t
arr = [4,3,0,-1]
insert_sort(arr)
print(arr)

# 冒泡排序
def bubbleSort(arr):length = len(arr)for i in range(length-1):flag = Truefor j in range(length-i-1):if arr[j]>arr[j+1]:t = arr[j]arr[j]=arr[j+1]arr[j+1]=tflag = Falseif flag:break
arr = [6,-2,0,9]
bubbleSort(arr)
print(arr)

def selectSort(arr):length = len(arr)for i in range(length-1):min = ifor j in range(i+1,length):if arr[min]>arr[j]:min=jif min!=i:t = arr[i]arr[i]=arr[min]arr[min]=t
arr = [6,-2,0,9]
selectSort(arr)
print(arr)

class Solution:def quicksort(self, array):""":type numRows: int:rtype: List[List[int]]"""if len(array)<=1:return arrayelse:pivot=array[0]small=[i for i in array[1:] if i<=pivot]big=[i for i in array[1:] if i >pivot]return self.quicksort(small)+[pivot]+self.quicksort(big)  //递归法，耗时

def quickSort(arr,left,right):# 递归终止条件if left>right:returnpivot = arr[left]i = leftj = rightwhile i<j:while i<j and arr[j]>=pivot:j-=1while i<j and arr[i]<=pivot:i+=1if i<j:t = arr[i]arr[i] = arr[j]arr[j] = t# 放入枢椎arr[left] = arr[i]arr[i]=pivot# 递归调用左区域quickSort(arr,left,i-1)# 递归调用右区域quickSort(arr,i+1,right)arr = [6,-2,0,9]
quickSort(arr,0,len(arr)-1)
print(arr)

# 希尔排序
def shellSort(arr):length =  len(arr)# 设置初始增量gap = length//2while gap>0:# 从第gap个元素，逐个对其所在组进行直接插入排序for i in range(gap,length):j = iwhile j-gap>=0 and arr[j]<arr[j-gap]:t = arr[j]arr[j] = arr[j-gap]arr[j-gap] = tj-=gapgap//=2
arr = [6,-2,0,9]
shellSort(arr)
print(arr)

class HeapSort:def heapSort(self, nums):length = len(nums)# 从后往前遍历，交换堆顶与最后叶子节点，并依次调整堆，重复操作for j in range(length-1,0,-1):# 获取堆顶元素(获取同时，调整堆)firstNum = self.adjustHeap(nums,j+1)# 交换最后一个叶子节点与堆顶元素temp = nums[j]nums[j] = firstNumnums[0] = tempreturn nums# 调整堆(最大堆)，每次返回最大堆顶元素def adjustHeap(self,nums,length):# 最后一个非叶节点i = length//2 -1# 从最后一个非叶节点开始调整，构成最大堆while i>=0:temp = nums[i]k = 2*i+1while k<length:if k+1<length and nums[k]<nums[k+1]:k+=1if nums[k]>temp:nums[i]=nums[k]i=kelse:breakk=2*k+1nums[i] = tempi-=1return nums[0]
s = HeapSort()
nums = [8,9,7,10]
t = s.heapSort(nums)
print(t)

def buildMaxHeap(self,arr):import mathfor i in range(math.floor(len(arr) / 2), -1, -1):self.heapify(arr, i)def heapify(self, arr, i):left = 2 * i + 1right = 2 * i + 2largest = iif left < arrLen and arr[left] > arr[largest]:largest = leftif right < arrLen and arr[right] > arr[largest]:largest = rightif largest != i:self.swap(arr, i, largest)self.heapify(arr, largest)def swap(self, arr, i, j):arr[i], arr[j] = arr[j], arr[i]def heapSort(self, arr):global arrLenarrLen = len(arr)self.buildMaxHeap(arr)for i in range(len(arr) - 1, 0, -1):self.swap(arr, 0, i)arrLen -= 1self.heapify(arr, 0)return arr

import math
class Solution:def mergeSort(self,arr):if (len(arr) < 2):return arrmiddle = math.floor(len(arr) / 2)left, right = arr[0:middle], arr[middle:]return self.merge(self.mergeSort(left), self.mergeSort(right))def merge(self,left, right):result = []while left and right:if left[0] <= right[0]:result.append(left.pop(0));else:result.append(right.pop(0));while left:result.append(left.pop(0));while right:result.append(right.pop(0));return result

#include "../stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include<functional>
#include <map>
#include <iostream>
using namespace std;void BubbleSort(vector<int> &arr){if (arr.size() <= 0)return;for (int len = arr.size() - 1; len >= 1; len--){for (int i = 0; i < len; i++){if (arr[i]>arr[i + 1])swap(arr[i], arr[i + 1]);}}
}void SelectionSort(vector<int> &arr){if (arr.size() <= 0)return;for (int i = 0; i < arr.size() - 1; i++){int min_index = i;for (int j = i + 1; j < arr.size(); j++){/*if (arr[j]<arr[j-1])    //每次左边起始位置向前移一个，但是并不能保证一轮下来，左边的数为最小值swap(arr[j-1], arr[j]);*/min_index = arr[min_index] < arr[j] ? min_index : j;}swap(arr[min_index],arr[i]);}
}void InsertSort(vector<int> &arr){if (arr.size() <= 0)return;for (int i = 1; i < arr.size(); i++){ //从索引1开始，前面索引0区域为插入空间for (int j = i - 1; j >= 0 && arr[j]>arr[j + 1]; j--) //--逆序（直接和插入空间最右(也即最大)的数比较，就可知是否进行插入）swap(arr[j], arr[j + 1]); //不是i,j直接比较    j--决定插入的具体位置，如（1，3，5）2
    }
}void QuickSort(vector<int> &arr,int L, int R){if (L >= R) //递归终止条件return;int pivot = arr[L];int i = L, j = R;while (i != j){//先从右边找，否则会报错while (arr[j] > pivot&&i < j)j--;while (arr[i] <= pivot&&i < j)i++;if (i < j){swap(arr[i],arr[j]);}}arr[L] = arr[i];arr[i] = pivot; //最终pivot位置为iQuickSort(arr, L, i - 1);QuickSort(arr, i + 1,R);
}//归并：先拆分为若干子数组，通过merge()对其逐步合并排序
void Merge(vector<int> &arr, int L, int mid, int R){int i = L, j = mid + 1;vector<int> new_arr;while (i <= mid&&j <= R){if (arr[i] <= arr[j])new_arr.push_back(arr[i]),i++;elsenew_arr.push_back(arr[j]),j++;}while (i <= mid)new_arr.push_back(arr[i]), i++;while (j <= R)new_arr.push_back(arr[j]), j++;for (int k = L, t = 0; k <= R; k++, t++) //把值复制回原arrarr[k] = new_arr[t];
}void MergeSort(vector<int> &arr, int L, int R){if (L >= R)return;else{int mid = (L + R) / 2;MergeSort(arr, L, mid);MergeSort(arr, mid + 1, R);Merge(arr, L, mid, R);}
}int main(void){vector<int> array = {2, 1, 3, 5, 2, 6, 9, 2, 7 };//BubbleSort(array);//SelectionSort(array);//InsertSort(array);//QuickSort(array, 0, array.size() - 1);MergeSort(array, 0, array.size() - 1);vector<int> vec = array;vector <int>::iterator it;for (it = vec.begin(); it != vec.end();it++)cout << *it << endl;getchar();return 0;
}