编程笔记 cha 2-1 排序
排序算法
1. 排序(牛客网)
#include <iostream>
#include <algorithm>
using namespace std;
void bubbleSort(int a[],int n){
int t;
for (int i=0;i<n-1;i++){
for (int j=0;j<n-i-1;j++){
if (a[j]>a[j+1]){
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
}
void selectSort(int a[],int n){
int k,t;
for (int i=0;i<n-1;i++){
k = i;
for (int j=i+1;j<n;j++){
if (a[j]<a[k]){
k = j;
}
}
if (k!=i){
t = a[k];
a[k] = a[i];
a[i] = t;
}
}
}
void Qsort(int a[],int low,int high){
if (low >= high)
return;
int first = low ;
int last = high ;
int key = a[first];
while (first < last){
while (first < last && a