叶为正的CSDN博客

厚积薄发 blog.yeweizheng.com

【字符串处理】说反话

#include <cstdio> #include <cstring>int main() { char str[90]; gets(str); int len = strlen(str), r = 0, h = 0;//r为行,h为列 c...

2017-11-19 00:37:19

阅读数:168

评论数:0

[字符串处理]回文串

#include <cstdio> #include <cstring> const int maxn=256; bool judeg(char str[]){ int len=strlen(str); for (int i = 0; i < len / 2;...

2017-11-19 00:01:10

阅读数:169

评论数:0

2-4 测试算法的性能-Selection-Sort-Detect-Performance

// // Created by liuyubobobo on 7/12/16. // #ifndef INC_03_SELECTION_SORT_DETECT_PERFORMANCE_SORTTESTHELPER_H #define INC_03_SELECTION_SORT_DETECT_PE...

2017-01-18 16:33:08

阅读数:223

评论数:0

2-3 随机生成算法测试用例-Selection-Sort-Generate-Test-Cases

// // Created by liuyubobobo on 7/12/16. // #ifndef INC_03_SELECTION_SORT_GENERATE_TEST_CASES_SORTTESTHELPER_H #define INC_03_SELECTION_SORT_GENERATE...

2017-01-13 21:45:40

阅读数:517

评论数:0

2-2 使用模板(泛型)编写算法-Selection-Sort-Using-Template

#include <iostream> #include "Student.h"using namespace std;template<typename T> void selectionSort(T arr[], int n){ for(int...

2017-01-13 21:14:43

阅读数:207

评论数:0

2-1选择排序 selectionSort

#include <iostream> #include <algorithm>using namespace std;void selectionSort(int arr[], int n){ for(int i = 0 ; i < n ; i ++){ ...

2017-01-13 20:47:08

阅读数:283

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭