排序算法
快速排序(Quick_Sort)
主要思想:
- 确定一个分界点: q[l]、q[(l + r) / 2]、q[r]
- 对区间内的每一个元素进行筛选,将小于分界点的元素放在分界点的左边,大于分界点的元素放在分界点的右边
- 最后通过递归,将分界点左右两边的元素进行排序
注意:当选择不同的分界点时,应注意递归语句里面形参的取值,否则会出现边界问题
c++版本:
#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int n;
int q[N];
void quick_sort(int q[], int l, int r){
if(l >= r) return;
int x = q[l], i = l - 1, j = r + 1 ;
while(i < j){
do i++; while (q[i] < x);
do j--; while (q[j] > x);
if(i < j) swap(q[i], q[j]);
}
quick_sort(q, l , j);
quick_sort(q, j + 1, r);
}
int main()
{
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", &q[i]);
quick_sort(q, 0, n - 1);
for(int i = 0; i < n; i++) printf("%d ", q[i]);
}
java版本:
import java.util.Scanner;
public class 快速排序 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] q = new int[n];
for(int i = 0; i < n; i++){
q[i] = sc.nextInt();
}
Quick_Sort(q, 0, n - 1);
for(int i = 0; i < n; i++){
System.out.printf("%d ",q[i]);
}
}
private static void Quick_Sort(int[] q, int l, int r) {
if(l >= r) return;
int x = q[l] , i = l - 1, j = r + 1 ;
while(i < j){
do i++; while (q[i] < x);
do j--; while (q[j] > x);
if(i < j) {
int t = q[i];
q[i] = q[j];
q[j] = t;
}
}
Quick_Sort(q, l , j);
Quick_Sort(q, j + 1, r);
}
}
*注意*:边界问题
当递归语句为:
quick_sort(q, l , j);
quick_sort(q, j + 1, r);
分界点应为:q[l] q[(l + r) / 2]
当递归语句为:
quick_sort(q, l , i - 1);
quick_sort(q, i, r);
分界点应为:q[r] q[(l + r + 1) / 2]
归并排序
主要思想:
- 确定分界点(该分界点为区间的中点)
- 通过递归,将将初始序列的n个元素分成n个有序的子序列,每个子序列中只有一个元素
- 再将子序列两两合并
c++代码
#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int n;
int q[N], tmp[N];
void merge_sort(int q[], int l, int r){
if(l >= r) return;
int mid = (l + r) / 2;
merge_sort(q, l , mid);
merge_sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while(i <= mid && j <= r){
if(q[i] <= q[j]) tmp[k++] = q[i++];
else tmp[k++] = q[j++];
}
while(i <= mid) tmp[k++] = q[i++];
while(j <= r) tmp[k++] = q[j++];
for(i = l, j = 0;i <= r; i++, j++) q[i] = tmp[j];
}
int main()
{
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", &q[i]);
merge_sort(q, 0, n - 1);
for(int i = 0; i < n; i++) printf("%d ", q[i]);
}
java代码
import java.util.Scanner;
public class 归并排序 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] q = new int[n];
for (int i = 0; i < n; i++) {
q[i] = sc.nextInt();
}
Merge_Sort(q, 0, n - 1);
for (int i = 0; i < n; i++) {
System.out.printf("%d ", q[i]);
}
}
private static void Merge_Sort(int[] q, int l, int r) {
int []tmp=new int[q.length];//辅助数组
if(l >= r) return;
int mid = (l + r) / 2;
Merge_Sort(q, l , mid);
Merge_Sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while(i <= mid && j <= r){
if(q[i] <= q[j]) tmp[k++] = q[i++];
else tmp[k++] = q[j++];
}
while(i <= mid) tmp[k++] = q[i++];
while(j <= r) tmp[k++] = q[j++];
for(i = l, j = 0;i <= r; i++, j++) q[i] = tmp[j];
}
}