选择排序。

#include<iostream>
#include<string>
using namespace std;
void SelectSort(string arr[], int len) {
	for (int i = 0; i < len-1; i++) {
		int max = i;
		for (int j = i + 1; j < len; j++) {
			arr[j].compare(arr[max])==1 ? max = j : max; //从大到小排
		}
		if (i != max) {
			swap(arr[i], arr[max]);
		}
	}
}

void printarr(string arr[], int len) {
	for (int i = 0; i < len; i++) {
		cout << arr[i];
	}
}

int main() {
	string arr[] = { "bbb","ccc","aaa","eee","ddd"};
	int len = sizeof(arr) / sizeof(arr[0]);
	SelectSort(arr, len);
	printarr(arr, len);
	return 0;
}