短学期Day.4（排序）

https://www.luogu.com.cn/problem/P1923

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long long n, k, a[5000010];
int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    nth_element(a, a + k, a + n);//使第k小整数就位 
    printf("%d", a[k]);//调用第k小整数
}

关于scanf、printf和cin、cout的效率问题：
（讲解了他们之间的效率问题）https://blog.csdn.net/YinJianxiang/article/details/76436089
函数语句：nth_element(数组名,数组名+第k小元素,数组名+元素个数)
https://www.luogu.com.cn/problem/P1012

#include<iostream> 
#include<string>

using namespace std;
string a[30]; //使用string更方便一些(可以直接比较大小)

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i]; //读入
    for (int i = 1; i < n; i++) //排序
    {
        for (int j = i + 1; j <= n; j++)
        {
            if (a[j] + a[i] > a[i] + a[j]) //string类型可以直接比较大小
            {
                swap(a[j], a[i]);  //交换a[i]与a[j],同样可以用swap(a[i],a[j]);
                /*
                    举个例子:如果是12,34，由于3412>1234，所以肯定要交换一下，直接用swap就可以了
                */
            }
        }
    } //排序结束
    for (int i = 1; i <= n; i++) cout << a[i]; //由于已经排好序了，直接输出即可
    return 0;
}

重点：排序（string类）

 for (int i = 1; i < n; i++) //排序
    {
        for (int j = i + 1; j <= n; j++)
        {
            if (a[j] + a[i] > a[i] + a[j]) //string类型可以直接比较大小
            {
                swap(a[j], a[i]);  //交换a[i]与a[j],同样可以用swap(a[i],a[j]);
                /*
                    举个例子:如果是12,34，由于3412>1234，所以肯定要交换一下，直接用swap就可以了
                */
            }
        }
    } //排序结束

直接选择排序：

template <class T>
void mySwap(T &x, T &y) {
	T temp = x;
	x = y;
	y = temp;
}

template <class T>
void selectionSort(T a[], int n) {
	for (int i = 0; i < n - 1; i++) {
		int leastIndex = i;	
		for (int j = i + 1; j < n; j++)
			if (a[j] < a[leastIndex])
				leastIndex = j;
		mySwap(a[i], a[leastIndex]);
	}
}

插入排序：

template <class T>
void insertionSort(T a[], int n) {
	int i, j;
	T temp;

	for (int i = 1; i < n; i++) {		
		int j = i;
		T temp = a[i];
		while (j > 0 && temp < a[j - 1]) {
			a[j] = a[j - 1];
			j--;
		}
		a[j] = temp;
	}
}

myswap代码：

template <class T>
void mySwap(T &x, T &y) {
	T temp = x;
	x = y;
	y = temp;
}

冒泡排序：

template <class T>
void bubbleSort(T a[], int n) {
	int i = n – 1;
	while (i > 0) {
	  int lastExchangeIndex = 0;
	  for (int j = 0; j < i; j++)
	    if (a[j + 1] < a[j]) {
         mySwap(a[j], a[j + 1]);
         lastExchangeIndex = j;
	    }
	   i = lastExchangeIndex;
	}
}

https://www.luogu.com.cn/problem/P5143

#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
using namespace std;
typedef struct point {
	int x, y, z;
}pt;
bool pd(pt a,pt b) {
	if (a.z < b.z) {
		return true;
	}
	else {
		return false;
	}
}
int main() {
	int n;
	cin >> n;
	pt* a;
	a = new pt[n];
	int i;
	for (i = 0; i < n; i++) {
		cin >> a[i].x >> a[i].y >> a[i].z;
	}
	sort(a, a + n, pd);
	double length = 0;
	for (i = 1; i < n; i++) {
		length += sqrt(pow(a[i].x - a[i - 1].x, 2) + pow(a[i].y - a[i - 1].y, 2) + pow(a[i].z - a[i - 1].z, 2));
	}
	cout << setiosflags(ios_base::fixed);
	cout << setprecision(3) << length << endl;
	//cout << length << endl;
	delete[]a;
	a = NULL;
	return 0;
}

亮点（用sort函数给结构体排序）：

sort(a, a + n, pd);
typedef struct point {
	int x, y, z;
}pt;
bool pd(pt a,pt b) {
	if (a.z < b.z) {
		return true;
	}
	else {
		return false;
	}
}

归并排序：

#include<iostream>
using namespace std;
void Merge(int arr[], int low, int mid, int high) {
    //low为第1有序区的第1个元素，i指向第1个元素, mid为第1有序区的最后1个元素
    int i = low, j = mid + 1, k = 0;  //mid+1为第2有序区第1个元素，j指向第1个元素
    int* temp = new int[high - low + 1]; //temp数组暂存合并的有序序列
    while (i <= mid && j <= high) {
        if (arr[i] <= arr[j]) //较小的先存入temp中
            temp[k++] = arr[i++];
        else
            temp[k++] = arr[j++];
    }
    while (i <= mid)//若比较完之后，第一个有序区仍有剩余，则直接复制到t数组中
        temp[k++] = arr[i++];
    while (j <= high)//同上
        temp[k++] = arr[j++];
    for (i = low, k = 0; i <= high; i++, k++)//将排好序的存回arr中low到high这区间
        arr[i] = temp[k];
    delete[]temp;//释放内存，由于指向的是数组，必须用delete []
}
void MergeSort(int arr[], int low, int high) {
    if (low >= high) { return; } // 终止递归的条件，子序列长度为1
    int mid = low + (high - low) / 2;  // 取得序列中间的元素
    MergeSort(arr, low, mid);  // 对左半边递归
    MergeSort(arr, mid + 1, high);  // 对右半边递归
    Merge(arr, low, mid, high);  // 合并
}
int main() {
	int p[10] = { 3,1,4,5,9,2,6,10,7,8 };
    MergeSort(p, 0, 9);
    for (int i = 0; i < 10; i++) {
        cout << p[i] << " ";
    }
    return 0;
}

快排（二叉树）：

#include<iostream>
#include<time.h>
using namespace std;
int my_part(int low, int high,int *p) {
	int dis = low;
	int num = p[low];
	for (int i = low + 1; i <= high; i++) {
		if (p[i] < num) {
			p[dis] = p[i];
			p[i] = p[++dis];
		}
	}
	p[dis] = num;
	return dis;
}

void my_quick_sort(int low, int high, int* p) {
	if (low >= high) {
		return;
	}
	int m = my_part(low, high, p);
	my_quick_sort(low, m - 1, p);
	my_quick_sort(m + 1, high, p);
}
int main() {
	srand(time(0));
	int* a;
	int n;
	cout << "输入数组大小：" << endl;
	cin >> n;
	a = new int[n];
	cout << "初始值（未排序）输出：" << endl;
	for (int i = 0; i < n;) {
		a[i] = rand() % 10000;
		cout << a[i] << "\t";
		i++;
		if (i % 10 == 0) {
			cout << endl;
		}
	}
	my_quick_sort(0, n-1, a);
	cout << "\n" << "排序后输出：" << endl;
	for (int i = 0; i < n;) {
		cout << a[i] << "\t";
		i++;
		if (i % 10 == 0) {
			cout << endl;
		}
	}
	delete[]a;
	a = nullptr;
	return 0;
}