面试必会知识整理------算法（排序）

归并排序：

时间复杂度O(nlogn);空间复杂度O(n); 稳定

• 方法一：采用一个格外数组只保存要进行归并的部分。

 void merger(vector<int>&data,int low, int high){//[low,high)
        if(high-low<2)return 0;
        int mid=((high-low)>>1)+low;

        merger(data,low,mid);
        merger(data,mid,high);
        
        vector<int> temp(data.begin()+low,data.begin()+high);
        int i=0,j=mid-low,k=low;
        while(i<mid-low){
            if(j>=temp.size()||temp[i]<=temp[j])
                data[k++]=temp[i++];
            else if(temp[i]>temp[j]){
                data[k++]=temp[j++];
            }
        }
    }

• 方法二：采用两个数组，分别保存要进行归并的两个部分（这样程序的可读性感觉好一些）

void merger(vector<int>&data,int low, int high){//[low,high)
        if(high-low<2)return 0;
        int mid=((high-low)>>1)+low;

        merger(data,low,mid);
        merger(data,mid,high);
        
        vector<int> left(data.begin()+low,data.begin()+mid);
        vector<int> right(data.begin()+mid,data.begin()+high);
        int i=0,j=0,k=low;
        while(i<left.size()){
            if(j>=right.size()||left[i]<=right[j])
                data[k++]=left[i++];
            else if(left[i]>right[j]){
                data[k++]=right[j++];
            }
        }
    }

归并排序的相关联系题：

• 牛客网剑指offer数组中的逆序对

 

快排

//快排
int  partition(vector<int> &nums, int low, int high){
	int target = nums[low];
	int index = low;
	for (++low; low <= high;){
		if (nums[low] <= target)
			++low;
		else{
			swap(nums[low], nums[high--]);
		}
	}
	swap(nums[index], nums[high]);
	return high;

}
void quickSort(vector<int> &nums, int low, int high){
	if (low >= high)
		return;
	int j = partition(nums, low, high);
	quickSort(nums, low, j-1);
	quickSort(nums, j+1, high);
}

 

堆

//堆
void down(vector<int>&nums, int node){
	while (node < (nums.size() >> 1)){
		int min = node;
		int left = (node << 1) + 1;
		int right = (node << 1) + 2;

		if (nums[left] < nums[min]){
			min = left;
		}
		if (right < nums.size() && nums[right] < nums[min]){
			min = right;
		}

		if (node == min)return;
		swap(nums[min], nums[node]);
		node = min;
	}
}
void My_make_heap(vector<int> &nums){
	int parent = (nums.size() >> 1) - 1;
	while (parent >= 0){
		down(nums, parent--);
	}
}