逆序数【归并排序】
#include<iostream>using namespace std;const int LENGTH = 100;char temp[LENGTH];int mergesort(char* s, int first, int last) { if (first == last) return 0; int mid = (first + last) / 2; int ret = ...
原创
2018-03-08 11:37:46 ·
165 阅读 ·
0 评论